THE SIMPLEX METHOD

Abstract

The simplex method of solution of a linear program first transforms the original system to an equivalent system of m equations in canonical form by an elimination of m of the n unknowns. If the right choice of m variables is made, then by equating the remaining variables to zero, an optimal solution is obtained to the original problem. If not, the method produces an improved set of m variables and a corresponding canonical form. The procedure is iterated until an optimum solution is obtained.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 09, 1956
Accession Number
AD0422843

Entities

People

  • G. B. Dantzig

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computer Programming
  • Economic Models
  • Elimination
  • Equations
  • Government Procurement
  • Governments
  • Heuristic Methods
  • Iterations
  • Linear Programming
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics

Readers

  • Operations Research