Archivo | Linear Programming (LP)

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

Production and Inventory Problem solved using Solver in Excel

production and inventory problem

Linear Programming allows us to tackle various real life problems, some of which we have already gone over in previous articles, such as the Transportation Problem, the Product Mix Problem and the Diet Problem. In the following article we will analyze a different classic application known as the Production Inventory Problem. This problem is essentially […]

Continue Reading 0

What is a Degenerate Optimal Solution in Linear Programming

Degenerate Optimal Solution

When applying the Simplex Method to calculate the minimum coefficient or feasibility condition, if there is a tie for the minimum ratio or minimum coefficient it can be broken arbitrarily. In this instance, at least one basic variable will become zero in the following iteration, confirming that in this instance the new solution is degenerate. […]

Continue Reading 0

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