| Edition |
2nd ed. |
| Description |
1 online resource (xxii, 449 pages) : illustrations |
|
text txt rdacontent |
|
computer c rdamedia |
|
online resource cr rdacarrier |
| Series |
Computer science and scientific computing series |
|
Computer science and scientific computing.
|
| Summary |
Linear programming finds the least expensive way to meet given needs with available resources. Its results are used in every area of engineering and commerce: agriculture, oil refining, banking, and air transport. Authors Kolman and Beck present the basic notions of linear programming and illustrate how they are used to solve important common problems. The software on the included disk leads students step-by-step through the calculations. The Second Edition is completely revised and provides additional review material on linear algebra as well as complete coverage of elementary linear programming. Other topics covered include: the Duality Theorem; transportation problems; the assignment problem; and the maximal flow problem. New figures and exercises are provided and the authors have updated all computer applications. The disk that comes with the book contains the student-oriented linear programming code SMPX, written by Professor Evar Nering of Arizona State University. The authors also recommend inexpensive linear programming software for personal computers. * More review material on linear algebra * Elementary linear programming covered more efficiently * Presentation improved, especially for the duality theorem, transportation problems, the assignment problem, and the maximal flow problem * New figures and exercises * Computer applications updated * Added disk with the student-oriented linear programming code SMPX, written by Professor Evar Nering of Arizona State University * New guide to inexpensive linear programming software for personal computers. |
| Contents |
Prologue: Introduction to Operations Research. Review of Linear Algebra: Matrices. Gauss-Jordan Reduction. The Inverse of a Matrix. Subspaces. Linear Independence and Basis. Introduction to Linear Programming: The Linear Programming Problem. Matrix Notation. Geometry of Linear Programming Problems. The Extreme Point Theorem. Basic Solutions. The Simplex Method: The Simplex Method for Problems in Standard Form. Degeneracy and Cycling. Artificial Variables. Further Topics in Linear Programming: Duality. The Duality Theorem. Computational Relations between the Primal and Dual Problems. The Dual Simplex Method. The Revised Simplex Method. Sensitivity Analysis. Computer Aspects. Integer Programming: Examples. Cutting Plane Methods. Branch and Bound Methods. Computer Aspects. Special Types of Linear Programming Problems: The Transportation Problem. The Assignment Problem. Graphs and Networks (Basic Definitions). The Maximal Flow Problem. The Shortest Route Problem. The Critical Path Method. Computer Aspects. Appendices: Karmarkar's Algorithm. Microcomputer Software. SMPX. Answers to Odd-Numbered Exercises. Index. |
| Bibliography |
Includes bibliographical references and index. |
| Note |
Print version record. |
| Subject |
Linear programming.
|
|
Programming, Linear |
|
Programmation linéaire.
|
|
Linear programming
|
| Added Author |
Beck, Robert E., 1941-
|
| Other Form: |
Print version: Kolman, Bernard, 1932- Elementary linear programming with applications. 2nd ed. San Diego : Academic Press, ©1995 012417910X 9780124179103 (DLC) 94041256 (OCoLC)31374333 |
| ISBN |
9780124179103 |
|
012417910X |
| Standard No. |
AU@ 000048129405 |
|
AU@ 000051556555 |
|
CHBIS 005673060 |
|
CHNEW 001005256 |
|
CHVBK 167271814 |
|
DEBBG BV036962212 |
|
DEBBG BV039830081 |
|
DEBBG BV042317232 |
|
DEBSZ 275175294 |
|
NZ1 12432464 |
|
NZ1 15192814 |
|
