Chapters in this book

1. Frontmatter i
2. Preface vii
3. Contents xi
4. 1. The Linear Programming Concept 1
5. 2. Origins and Influences 12
6. 3. Formulating a Linear Programming Model 32
7. 4. Linear Equation and Inequality Systems 69
8. 5. The Simplex Method 94
9. 6. Proof of the Simplex Algorithm and the Duality Theorem 120
10. 7. The Geometry of Linear Programs 147
11. 8. Pivoting, Vector Spaces, Matrices, and Inverses 173
12. 9. The Simplex Method Using Multipliers 210
13. 10. Finiteness of the Simplex Method under Perturbation 228
14. 11. Variants of the Simplex Algorithm 240
15. 12. The Price Concept in Linear Programming 254
16. 13. Games And Linear Programs 277
17. 14. The Classical Transportation Problem 299
18. 15. Optimal Assignment and Other Distribution Problems 316
19. 16. The Transshipment Problem 335
20. 17. Networks and the Transshipment Problem 352
21. 18. Variables with Upper Bounds 368
22. 19. Maximal Flows in Networks 385
23. 20. The Primal-Dual Method for Transportation Problems 404
24. 21. The Weighted Distribution Problem 413
25. 22. Programs with Variable Coefficients 433
26. 23. A Decomposition Principle for Linear Programs 448
27. 24. Convex Programming 471
28. 25. Uncertainty 499
29. 26. Discrete-Variable Extremum Problems 514
30. 27. Stigler’s Nutrition Model: An Example of Formulation and Solution 551
31. 28. The Allocation of Aircraft to Routes under Uncertain Demand 568
32. Bibliography 592
33. Subject Index 617
34. Name Index 625
35. Selected Rand Books 629