Linear Programming Duality

  • Achim Bachem
  • Walter Kern
Part of the Universitext book series (UTX)

Abstract

After this “tour de force” in abstract duality theory, the reader — if there still is any — will probably be glad to learn that we are now coming back to Kn, in order to have a short break there and solve our optimization problems from Chapter 4. Our main object however will be to show that linear programming essentially is an oriented matroid problem.

Keywords

Feasible Solution Combinatorial Problem Dual Pair Sign Vector Linear Optimization Problem 
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-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Achim Bachem
    • 1
  • Walter Kern
    • 2
  1. 1.Mathematisches InstitutUniversität zu KölnKöln 41Fed. Rep. of Germany
  2. 2.Department of Applied MathematicsUniversity of TwenteAE EnschedeThe Netherlands

Personalised recommendations