• Summary
• Linear programming problems
• Methods for linear programming
• Polyhedra
• Vertices and directions
• A fundamental property of linear programming
• The simplex method: an outline
• In order to apply the previous idea...
• Basic solutions
• Optimality conditions
• Pivot and unboundedness condition
• Procedure simplex
• Phase I of the simplex method
• Degeneracy
• The dual problem
• Strong duality
• Economic interpretation of the dual variables
• Shadow prices