Archivo | Linear Programming (LP)

Linear Programming (LP) and Operations Research (OR) resources for students.

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 2

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

How to Solve a Linear Programming model with Dual Simplex Method


The Dual Simplex Method offers an alternative when solving Linear Programming (LP) models with algorithms. This method may be used in particular when the standard way to carry a linear programming model is not available from an initial basic feasible solution. Consider the following LP problem to illustrate the application of the Dual Simplex Method: […]

Continue Reading 2

Our Site is Proudly Hosted on