 |
|
| LINEAR PROGRAMS & RELATED PROBLEMS
| |
| | |
|
|
A Volume in the COMPUTER SCIENCE and SCIENTIFIC COMPUTING Series
To order this title, and for more information, click here
By
Evar Nering, Arizona State University, Tempe
Albert Tucker, Princeton University, New Jersey
Description
This text is concerned primarily with the theory of linear and nonlinear programming, and a number of closely-related problems, and with
algorithms appropriate to those problems. In the first part of the book, the authors introduce the concept of duality which serves as
a unifying concept throughout the book. The simplex algorithm is presented along with modifications and adaptations to problems with
special structures. Two alternative algorithms, the ellipsoidal algorithm and Karmarker's algorithm, are also discussed, along with numerical
considerations. the second part of the book looks at specific types of problems and methods for their solution. This book is designed
as a textbook for mathematical programming courses, and each chapter contains numerous exercises and examples.
Audience
Students of operations research, engineering, mathematics, and computer science.
Contents
Sample Linear Problems. Tableau Algebra. Canonical Duality. the Simplex Algorithm. General Linear Programs. Numerical Considerations.
Matrix Games. Assignment and Matching Problems. Transportations Problems. Network Flow Problems. The Transshipment Problem. Nonlinear
programs.
| Bibliographic details |
Hardbound, 584 pages, publication date: OCT-1992
ISBN-13: 978-0-12-515440-6
ISBN-10: 0-12-515440-2
Imprint: ACADEMIC PRESS
|
| Price and Ordering |
Price:
EUR 75.95
USD 103
GBP 64
|  |
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