 |
|
| ELEMENTARY LINEAR PROGRAMMING WITH APPLICATIONS
| |
| | |
|
|
To order this title, and for more information, click here
Second Edition
By
Bernard Kolman, Drexel University
Robert Beck, Villanova University
Description
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.
Audience
Students in one-term undergraduate course on linear programming. Focused on students in quantitative fields who need some business-related
skills, or for business students who need to develop quantitative methods for decision-making.
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.
| Bibliographic details |
Hardbound, 449 pages, publication date: JUN-1995
ISBN-13: 978-0-12-417910-3
ISBN-10: 0-12-417910-X
Imprint: ACADEMIC PRESS
|
| Price and Ordering |
Price:
EUR 97.95
USD 135
GBP 83
|  |
Books and book related electronic products are priced in US dollars (USD), euro (EUR), and Great Britain Pounds (GBP). USD prices apply to the Americas and Asia Pacific. EUR prices apply in Europe and the Middle East. GBP prices apply to the UK and all other countries.
|
See also information about conditions of sale & ordering procedures, and links to our regional sales offices.
|
050/774
Last update: 4 Sep 2009
|
|
| |
| | |
|
|
| |
Home | Elsevier Sites | Privacy Policy | Terms and Conditions | Feedback | Site Map | A Reed Elsevier Company