Computational Procedures for Solving Linear Programming Problems

  • Sven Danø


As we have seen in Ch. II1, the simplex procedure can be described as a systematic method of examining the set of basic feasible solutions, starting in an arbitrary initial basis of m variables (activities) where m is the number of linear restrictions. If the initial basic solution does not satisfy the simplex criterion, we move to a neighbouring basis by replacing one of the basic variables, and so forth, until a basic feasible solution is attained in which all of the simplex coefficients are non-positive (in a minimization problem, non-negative). By the Fundamental Theorem, such a solution will be an optimal solution.


Basic Solution Linear Programming Problem Basic Variable Artificial Variable Basic Feasible Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag/Wien 1974

Authors and Affiliations

  • Sven Danø
    • 1
  1. 1.University of CopenhagenDenmark

Personalised recommendations