
- 651 pages
- English
- PDF
- Available on iOS & Android
Linear Programming and Extensions
About this book
The influential book that established the mathematical discipline of linear programming
In the worlds of finance, business, and management, mathematicians and economists frequently encounter problems of optimization. In this classic book, George Dantzig shows how the methods of linear programming can provide solutions. Drawing on a wealth of examples, he introduces the basic theory of linear inequalities and describes the powerful simplex method used to solve them. He discusses the price concept, the transportation problem, and matrix methods, and covers key mathematical concepts such as the properties of convex sets and linear vector spaces. Dantzig demonstrates how linear programming can be applied to a host of optimization problems, from minimizing traffic congestion to maximizing the scheduling of airline flights.
An invaluable resource for students and practitioners alike, Linear Programming and Extensions is an extraordinary account of the development and uses of this versatile mathematical technique, blending foundational research in mathematical theory with computation, economic analysis, and applications to industrial problems.
Trusted by 375,005 students
Access to over 1 million titles for a fair monthly price.
Study more efficiently using our study tools.
Information
Table of contents
- Cover
- Title
- Copyright
- Dedication
- CONTENTS
- Preface
- CHAPTER 1 THE LINEAR PROGRAMMING CONCEPT
- CHAPTER 2 ORIGINS AND INFLUENCES
- CHAPTER 3 FORMULATING A LINEAR PROGRAMMING MODEL
- CHAPTER 4 LINEAR EQUATION AND INEQUALITY SYSTEMS
- CHAPTER 5 THE SIMPLEX METHOD
- CHAPTER 6 PROOF OF THE SIMPLEX ALGORITHM AND THE DUALITY THEOREM
- CHAPTER 7 THE GEOMETRY OF LINEAR PROGRAMS
- CHAPTER 8 PIVOTING, VECTOR SPACES, MATRICES, AND INVERSES
- CHAPTER 9 THE SIMPLEX METHOD USING MULTIPLIERS
- CHAPTER 10 FINITENESS OF THE SIMPLEX METHOD UNDER PERTURBATION
- CHAPTER 11 VARIANTS OF THE SIMPLEX ALGORITHM
- CHAPTER 12 THE PRICE CONCEPT IN LINEAR PROGRAMMING
- CHAPTER 13 GAMES AND LINEAR PROGRAMS
- CHAPTER 14 THE CLASSICAL TRANSPORTATION PROBLEM
- CHAPTER 15 OPTIMAL ASSIGNMENT AND OTHER DISTRIBUTION PROBLEMS
- CHAPTER 16 THE TRANSSHIPMENT PROBLEM
- CHAPTER 17 NETWORKS AND THE TRANSSHIPMENT PROBLEM
- CHAPTER 18 VARIABLES WITH UPPER BOUNDS
- CHAPTER 19 MAXIMAL FLOWS IN NETWORKS
- CHAPTER 20 THE PRIMAL-DUAL METHOD FOR TRANSPORTATION PROBLEMS
- CHAPTER 21 THE WEIGHTED DISTRIBUTION PROBLEM
- CHAPTER 22 PROGRAMS WITH VARIABLE COEFFICIENTS
- CHAPTER 23 A DECOMPOSITION PRINCIPLE FOR LINEAR PROGRAMS
- CHAPTER 24 CONVEX PROGRAMMING
- CHAPTER 25 UNCERTAINTY
- CHAPTER 26 DISCRETE VARIABLE EXTREMUM PROBLEMS
- CHAPTER 27 STIGLER’S NUTRITION MODEL: AN EXAMPLE OF FORMULATION AND SOLUTION
- CHAPTER 28 THE ALLOCATION OF AIRCRAFT TO ROUTES UNDER UNCERTAIN DEMAND
- BIBLIOGRAPHY
- INDEX
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app