Advertisement

Duality of Linear Programming

  • Jiří Matoušek
  • Bernd Gärtner
Chapter
  • 8.1k Downloads
Part of the Universitext book series (UTX)

Abstract

Here we formulate arguably the most important theoretical result about linear programs.

Keywords

Feasible Solution Convex Cone Simplex Method Linear Inequality Duality Theorem 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Authors and Affiliations

  • Jiří Matoušek
    • 1
  • Bernd Gärtner
    • 2
  1. 1.Department of Applied MathematicsCharles UniversityPraha 1Czech Republic
  2. 2.Institute of Theoretical Computer ScienceETH ZurichZurichSwitzerland

Personalised recommendations