Items
Linked e-resources
Details
Table of Contents
Introduction
1. The Allocation Problem; Duality
2. Matrix Notation for Dual Problems
3. Feasibility; Theorems on Duality and Existence
4. Convex Sets; Boundedness
5. The Prepared Problem; Boundedness and Consistency
6. Optimal Points; Motivation of the Simplex Method
7. The Simplex Method; Tableaux
8. Effectiveness of the Simplex Method
9. Solution of the Dual Problem.
1. The Allocation Problem; Duality
2. Matrix Notation for Dual Problems
3. Feasibility; Theorems on Duality and Existence
4. Convex Sets; Boundedness
5. The Prepared Problem; Boundedness and Consistency
6. Optimal Points; Motivation of the Simplex Method
7. The Simplex Method; Tableaux
8. Effectiveness of the Simplex Method
9. Solution of the Dual Problem.