Duality of Linear Programming
Part of the Universitext book series (UTX)
- 8.1k Downloads
Here we formulate arguably the most important theoretical result about linear programs.
KeywordsFeasible 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.
Unable to display preview. Download preview PDF.
© Springer 2007