Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by Princeton University Press 1963

5. The Simplex Method

From the book Linear Programming and Extensions

  • George Dantzig
https://doi.org/10.1515/9781400884179-006
© 2016 Princeton University Press, Princeton
From the book
Linear Programming and Extensions
Linear Programming and Extensions

Chapters in this book (35)

Frontmatter
Preface
Contents
1. The Linear Programming Concept
2. Origins and Influences
3. Formulating a Linear Programming Model
4. Linear Equation and Inequality Systems
5. The Simplex Method
6. Proof of the Simplex Algorithm and the Duality Theorem
7. The Geometry of Linear Programs
8. Pivoting, Vector Spaces, Matrices, and Inverses
9. The Simplex Method Using Multipliers
10. Finiteness of the Simplex Method under Perturbation
11. Variants of the Simplex Algorithm
12. The Price Concept in Linear Programming
13. Games And Linear Programs
14. The Classical Transportation Problem
15. Optimal Assignment and Other Distribution Problems
16. The Transshipment Problem
17. Networks and the Transshipment Problem
18. Variables with Upper Bounds
19. Maximal Flows in Networks
20. The Primal-Dual Method for Transportation Problems
21. The Weighted Distribution Problem
22. Programs with Variable Coefficients
23. A Decomposition Principle for Linear Programs
24. Convex Programming
25. Uncertainty
26. Discrete-Variable Extremum Problems
27. Stigler’s Nutrition Model: An Example of Formulation and Solution
28. The Allocation of Aircraft to Routes under Uncertain Demand
Bibliography
Subject Index
Name Index
Selected Rand Books
Downloaded on 18.7.2024 from https://www.degruyter.com/document/doi/10.1515/9781400884179-006/pdf
Scroll to top button