OpenSolver is a great Excel Add-in that solves optimization models. The following article will describe how to solve a Linear Programming model using this tool (first you must Download and install OpenSolver in Excel). For educational purposes we will consider a linear programming model with two decision variables and four constraints, nevertheless you can easily extend […]

The post How to Solve a Linear Programming model with OpenSolver appeared first on Linear Programming.

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

The post Production and Inventory Problem solved using Solver in Excel appeared first on Linear Programming.

]]>As we have discussed in previous articles, the Shadow Price of a constraint represents the rate of change of the optimal value as a result of a marginal change in the right-hand side of a constraint. “Marginal” is understood as a modification that does not change the geometry of the problem, that is to say, […]

The post What does a Shadow Price of Zero mean in Linear Programming appeared first on Linear Programming.

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

The post What is a Degenerate Optimal Solution in Linear Programming appeared first on Linear Programming.

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

The post Vogel Approximation Method (Transportation Algorithm in Linear Programming) appeared first on Linear Programming.

]]>