Linear Inequalities and Related Systems
1st Edition
Published on 20. June 2016
346 pages
978-1-4008-8198-7 (ISBN)
Description
A classic treatment of linear inequalities from the acclaimed Annals of Mathematics Studies series
Princeton University Press is proud to have published the Annals of Mathematics Studies since 1940. One of the oldest and most respected series in science publishing, it has included many of the most important and influential mathematical works of the twentieth century. The series continues this tradition as Princeton University Press publishes the major works of the twenty-first century.
To mark the continued success of the series, all books are available in paperback and as ebooks.
Princeton University Press is proud to have published the Annals of Mathematics Studies since 1940. One of the oldest and most respected series in science publishing, it has included many of the most important and influential mathematical works of the twentieth century. The series continues this tradition as Princeton University Press publishes the major works of the twenty-first century.
To mark the continued success of the series, all books are available in paperback and as ebooks.
More details
Other editions
Additional editions
Harold W. Kuhn | Albert William Tucker
Linear Inequalities and Related Systems
Book
10/1956
Princeton University Press
€98.80
Shipment within 10-20 days
Persons
Harold William Kuhn & Albert William Tucker
Content
Frontmatter, pg. i
Preface, pg. v
Contents, pg. xxiii
1. Dual Systems of Homogeneous Linear Relations, pg. 1
2. Polyhedral Convex Cones, pg. 19
3. Resolution and Separation Theorems for Polyhedral Convex Sets, pg. 41
4. Theory of Linear Programming, pg. 53
5. On Systems of Linear Inequalities, pg. 99
6. Infinite Programs, pg. 157
7* A Primal-Dual Algorithm for Linear Programs, pg. 171
8. Marginal Values of Matrix Games and Linear Programs, pg. 183
9. Determinateness of Polyhedral Games, pg. 195
10. On Systems of Distinct Representatives, pg. 199
11. Dilworth's Theorem on Partially Ordered Sets, pg. 207
12. On the Max-Flow Min-Cut Theorem of Networks, pg. 215
13. Integral Boundary Points of Convex Polyhedra, pg. 223
14. An Extension of a Theorem of Dantzig's, pg. 247
15. Neighboring Vertices on a Convex Polyhedron, pg. 255
16. On a Theorem of Wald, pg. 265
17. On the Solution of a Game-Theoretic Problem, pg. 275
18. The Closed Linear Model of Production, pg. 285
Bibliography, pg. 305
Backmatter, pg. 326
Preface, pg. v
Contents, pg. xxiii
1. Dual Systems of Homogeneous Linear Relations, pg. 1
2. Polyhedral Convex Cones, pg. 19
3. Resolution and Separation Theorems for Polyhedral Convex Sets, pg. 41
4. Theory of Linear Programming, pg. 53
5. On Systems of Linear Inequalities, pg. 99
6. Infinite Programs, pg. 157
7* A Primal-Dual Algorithm for Linear Programs, pg. 171
8. Marginal Values of Matrix Games and Linear Programs, pg. 183
9. Determinateness of Polyhedral Games, pg. 195
10. On Systems of Distinct Representatives, pg. 199
11. Dilworth's Theorem on Partially Ordered Sets, pg. 207
12. On the Max-Flow Min-Cut Theorem of Networks, pg. 215
13. Integral Boundary Points of Convex Polyhedra, pg. 223
14. An Extension of a Theorem of Dantzig's, pg. 247
15. Neighboring Vertices on a Convex Polyhedron, pg. 255
16. On a Theorem of Wald, pg. 265
17. On the Solution of a Game-Theoretic Problem, pg. 275
18. The Closed Linear Model of Production, pg. 285
Bibliography, pg. 305
Backmatter, pg. 326
