Reminiscences About the Origins of Linear Programming

G. B. Dantzig
Additional contact information
G. B. Dantzig: Stanford University, Department of Operations Research

A chapter in Mathematical Programming The State of the Art, 1983, pp 78-86 from Springer

Abstract: Abstract The author recalls the early days of linear programming, the contributions of von Neumann, Leontief, Koopmans and others. Linear Programming is viewed as a revolutionary development giving man the ability to state general objectives and to find, by means of the simplex method, optimal policy decisions for a broad class of practical decision problems of great complexity. In the real world, planning tends to be ad hoc because of the many special-interest groups with their multiple objectives. Much work remains to develop a more disciplined infrastructure for decision making in which the full potential of mathematical programming models could be realized.

Keywords: Travelling Salesman Problem; Simplex Method; Ground Rule; Mathematical Programming Model; Practical Planning (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-68874-4_4

Ordering information: This item can be ordered from
http://www.springer.com/9783642688744

DOI: 10.1007/978-3-642-68874-4_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().