Recent Advances in Linear Programming
George B. Dantzig · Management Science · 1956
As interest grows rapidly in industry on the potentialities of mathematical programming techniques, it appears worthwhile to have a paper devoted to some of the more promising developments which may speed up the transition from interest to use. Three topics have been selected (in three sections that follow) which have recently come into prominence: uncertainty, combinatorial problems, and large scale systems. The reader will find in the course of their discussions that a survey—though perhaps not a systematic survey—has been made of current techniques in the linear programming field.
Cited by 84 works. doi:10.1287/mnsc.2.2.131
Authors
References
- Maximal Flow Through a Network
- Application of the simplex method to a transportation problem
- An Introduction to Linear Programming
- Linear Programming Under Uncertainty
- Minimization of non‐linear separable convex functionals
- The dual method of solving the linear programming problem
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
- The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
- Smooth Patterns of Production
- The caterer problem