The New Palgrave Dictionary of Economics

2018 Edition
| Editors: Macmillan Publishers Ltd

Simplex Method for Solving Linear Programs

  • George B. Dantzig
Reference work entry
DOI: https://doi.org/10.1057/978-1-349-95189-5_1457

Abstract

The simplex method is used to solve linear programming problems based on pivoting from one iteration to the next. Invented by George Dantzig in 1947, it can be stated in 20 or so instructions for a computer. Commercial codes based on the simplex method, however, usually involve thousands of instructions which are there to take advantage of sparsity (most coefficients of practical problems are zero), to make it easy to start from solutions to variants of the same problem, and to guarantee numerical accuracy of the solution for large-scale systems.

Keywords

Basic feasible solutions Dantzig, G.B. Duality Lagrange multipliers Linear programming Pivoting Simplex method for solving linear programs 

JEL Classifications

C6 
This is a preview of subscription content, log in to check access.

Copyright information

© Macmillan Publishers Ltd. 2018

Authors and Affiliations

  • George B. Dantzig
    • 1
  1. 1.