Linear Programming : An introduction to Finite Improvement Algorithms Daniel Solow.
Material type:
TextPublisher: Mineola, New York : Dover Publications, Inc., [2014]Edition: Second Dover editionDescription: xv, 414 pages : illustrations ; 23 cmContent type: text Media type: unmediated Carrier type: volumeISBN: 9780486493763 (paperback); 0486493768 (paperback)Subject(s): Linear programming | MATHEMATICS / Linear ProgrammingDDC classification: 519.72 LOC classification: T57.74 | .S653 2014Other classification: MAT017000 Summary: "Suitable for undergraduate students of mathematics and graduate students of operations research and engineering, this text covers the basic theory and computation for a first course in linear programming. In addition to substantial material on mathematical proof techniques and sophisticated computation methods, the treatment features numerous examples and exercises. An introductory chapter offers a systematic and organized approach to problem formulation. Subsequent chapters explore geometric motivation, proof techniques, linear algebra and algebraic steps related to the simplex algorithm, standard phase 1 problems, and computational implementation of the simplex algorithm. Additional topics include duality theory, issues of sensitivity and parametric analysis, techniques for handling bound constraints, and network flow problems. Helpful appendixes conclude the text, including a new addition that explains how to use Excel to solve linear programming problems"-- Provided by publisher.
| Item type | Current location | Home library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
Book
|
School of Natural Sciences (SNS) | School of Natural Sciences (SNS) | 519.72 (Browse shelf) | Available | SNS0002549 |
"Second edition."
Reprint of: New York : North-Holland, ©1984. With introduction and an appendix C.
Includes bibliographical references and index.
"Suitable for undergraduate students of mathematics and graduate students of operations research and engineering, this text covers the basic theory and computation for a first course in linear programming. In addition to substantial material on mathematical proof techniques and sophisticated computation methods, the treatment features numerous examples and exercises. An introductory chapter offers a systematic and organized approach to problem formulation. Subsequent chapters explore geometric motivation, proof techniques, linear algebra and algebraic steps related to the simplex algorithm, standard phase 1 problems, and computational implementation of the simplex algorithm. Additional topics include duality theory, issues of sensitivity and parametric analysis, techniques for handling bound constraints, and network flow problems. Helpful appendixes conclude the text, including a new addition that explains how to use Excel to solve linear programming problems"-- Provided by publisher.
There are no comments on this title.