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 = […]

# Archivo de Etiquetas (Tags) | basic feasible solution

## Northwest Corner Method (Transportation Algorithm in Linear Programming)

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 […]

## How to Calculate the Shadow Price of a Constraint

The Shadow Price of a constraint in Linear Programming indicates how much the value of an objective (optimal) function changes due to a marginal variation in the right-hand side of a constraint. It is assumed that the rest of the model’s parameters remain constant. It should be noted beforehand that the Shadow Price can be […]

## Linear Programming (Graphical Method)

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 […]

## 10 Things You need to know about Simplex Method

The Simplex Method was developed by George Dantzing in 1947. It is without a doubt the most popular algorithm when it comes to solving a Linear Programming (LP) model, and it plays a major role in the introduction to Operations Research (OR). Today we’re presenting a summary of 10 main concepts about the use and […]