Linear Programming Duality
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.
KeywordsFeasible Solution Combinatorial Problem Dual Pair Sign Vector Linear Optimization Problem
Unable to display preview. Download preview PDF.