Linear Programming 1

Mukund N. Thapa

ISBN 10: 1475781121 / ISBN 13: 9781475781120

Published by Springer New York, Springer US Apr 2013, 2013

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -By George B. Dantzig LINEAR PROGRAMMING The Story About How It Began: Some legends, a little about its historical sign- cance, and comments about where its many mathematical programming extensions may be headed. Industrial production, the ow of resources in the economy, the exertion of military e ort in a war, the management of nances-all require the coordination of interrelated activities. What these complex undertakings share in common is the task of constructing a statement of actions to be performed, their timing and quantity(calledaprogramorschedule), that, ifimplemented, wouldmovethesystem from a given initial status as much as possible towards some de ned goal. While di erences may exist in the goals to be achieved, the particular processes, and the magnitudes of e ort involved, when modeled in mathematical terms these seemingly disparate systems often have a remarkably similar mathematical str- ture. The computational task is then to devise for these systems an algorithm for choosing the best schedule of actions from among the possible alternatives. The observation, in particular, that a number of economic, industrial, nancial, and military systems can be modeled (or reasonably approximated) by mathem- ical systems of linear inequalities and equations has given rise to the development of the linear programming eld. 476 pp. Englisch.

Seller Inventory # 9781475781120

Bibliographic Details

• Title: Linear Programming 1
• Publisher: Springer New York, Springer US Apr 2013
• Publication Date: 2013
• Language: English
• ISBN 10: 1475781121
• ISBN 13: 9781475781120
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

By George B. Dantzig LINEAR PROGRAMMING The Story About How It Began: Some legends, a little about its historical sign- cance, and comments about where its many mathematical programming extensions may be headed. Industrial production, the ?ow of resources in the economy, the exertion of military e?ort in a war, the management of ?nances―all require the coordination of interrelated activities. What these complex undertakings share in common is the task of constructing a statement of actions to be performed, their timing and quantity(calledaprogramorschedule), that, ifimplemented, wouldmovethesystem from a given initial status as much as possible towards some de?ned goal. While di?erences may exist in the goals to be achieved, the particular processes, and the magnitudes of e?ort involved, when modeled in mathematical terms these seemingly disparate systems often have a remarkably similar mathematical str- ture. The computational task is then to devise for these systems an algorithm for choosing the best schedule of actions from among the possible alternatives. The observation, in particular, that a number of economic, industrial, ?nancial, and military systems can be modeled (or reasonably approximated) by mathem- ical systems of linear inequalities and equations has given rise to the development of the linear programming ?eld.