|
|
|
|
| LEADER |
04074nmm a2200289 u 4500 |
| 001 |
EB000707428 |
| 003 |
EBX01000000000000000560510 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783709136478
|
| 100 |
1 |
|
|a Dano, Sven
|
| 245 |
0 |
0 |
|a Linear Programming in Industry
|h Elektronische Ressource
|b Theory and Applications. An Introduction
|c by Sven Dano
|
| 250 |
|
|
|a 2nd ed. 1963
|
| 260 |
|
|
|a Vienna
|b Springer Vienna
|c 1963, 1963
|
| 300 |
|
|
|a VIII, 120 p
|b online resource
|
| 505 |
0 |
|
|a I. Introduction -- A. Planning Company Operations: The General Problem -- B. Linear Planning Models -- C. A Simple Example -- II. Elements of the Mathematical Theory of Linear Programming -- A. The Fundamental Theorem -- B. The Simplex Method and the Simplex Criterion -- III. A Practical Example -- IV. Linear Models of Production and Economic Optimization -- A. The Linear Production Model -- B. Profit Maximization and Cost Minimization -- C. The Basic Assumptions of Linear Programming -- V. Industrial Applications -- A. Blending Problems -- B. Optimal Utilization of Machine Capacities -- C. Inventory Problems -- D. Transportation Problems -- VI. Computational Procedures for Solving Linear Programming Problems -- A. The Simplex Method -- B. The Simplex Tableau -- C. Alternate Optima and Second-Best Solutions -- D. Computational Short Cuts -- E. The Case of Degeneracy -- F. Procedure for Solving Transportation Problems -- VII. Duality in Linear Programming -- A. The Duality Theorem -- B. Economic Interpretation of the Dual -- VIII. The Effects of Coefficient Variations on the Solution -- A. Parametric Programming -- B. A Concrete Example -- IX. The Applicability of Linear Programming in Industry -- A. Linear Programming and Investment Decisions -- B. The Scheduling Problem -- C. Linear Programming versus “Common-Sense” Methods -- A. Proof of the Fundamental Theorem -- B. The Simplex Criterion -- C. The Simplex Algorithm -- D. Proof of the Duality Theorem -- Numerical Exercises
|
| 653 |
|
|
|a Engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer Science
|
| 653 |
|
|
|a Technology and Engineering
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 028 |
5 |
0 |
|a 10.1007/978-3-7091-3647-8
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-7091-3647-8?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004
|
| 520 |
|
|
|a The present volume is intended to serve a twofold purpose. First, it provides a university text of Linear Programming for students of .economics or operations research interested in the theory of production and cost and its practical applications; secondly, it is the author's hope that engineers, business executives, managers, and others responsible for the organization and planning of industrial operations may find the book useful as an introduction to Linear Programming methods and techniques. Despite the different backgrounds of these categories of potential readerft, their respective fields overlap to a considerable extent; both are concernE:'d with economic optimization problems, and the use of Linear Programming to problems of production planning is simply applied theory of production. The non-economist reader may, but should not, pass over Chapter IV in which the linear production model is linked up with the economic theory of production. Without bE:'ing an advanced text, the book aims at covering enough ground to make the reader capable of detecting, formulating, and solving such linear planning problems as he may encounter within his particular field. No heavy demands are made on the reader's mathematical profi ciency; except for the proofs in the Appendix-which may be skipped if desired-the mathematical exposition is purely elementary, involving only simple linear relations. In the author's experience, the pedagogical advantages of this approach, as compared with the use of matrix algebra, amply justify the sacrifice of mathematical elegance and typographical simplicity, particularly in explaining the simplex method
|