Archivo de Etiquetas (Tags) | basic feasible solution

Vogel Approximation Method (Transportation Algorithm in Linear Programming)

example vogel method

The Vogel Approximation Method is an improved version of the Minimum Cell Cost Method and the Northwest Corner Method that in general produces better initial basic feasible solution, which are understood as basic feasible solutions that report a smaller value in the objective (minimization) function of a balanced Transportation Problem (sum of the supply = […]

Continue Reading 2

Northwest Corner Method (Transportation Algorithm in Linear Programming)

Northwest Corner Model solution

The Northwest Corner Method (or upper left-hand corner) is a heuristic that is applied to a special type of Linear Programming problem structure called the Transportation Model, which ensures that there is an initial basic feasible solution (non artificial). Other methods for obtaining an initial basic solution are the Minimum Cell Cost Method and the […]

Continue Reading 1

Linear Programming (Graphical Method)

graphical method linear programming

The Graphical Method (graphic solving) is an excellent alternative for the representation and solving of Linear Programming models that have two decision variables. For this purpose there are computational tools that assist in applying the graphical model, like TORA, IORTutorial and Geogebra. Within this context we will present a series of Linear Programming exercises that have been […]

Continue Reading 0