Duality in Linear Programming

  • Sven Danø


Linear programming models possess the interesting property of forming pairs of symmetrical problems. To any maximization problem corresponds a minimization problem involving the same data, and there is a close correspondence between their optimal solutions. The two problems are said to be “duals” of each other.


Dual Problem Maximization Problem Duality Theorem Shadow Price Optimal Basis 
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 1965

Authors and Affiliations

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

Personalised recommendations