MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02252nam a22002177a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20200923155205.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
190122b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0716711958 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0716715872 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
0 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
519.72 |
| Item number |
CHA |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Chvatal, Vasek |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Linear programming |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
New York : |
| Name of publisher, distributor, etc. |
W.H. Freeman, |
| Date of publication, distribution, etc. |
©1983. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Page number |
xiii, 478 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm |
| 440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Series of books in the mathematical sciences. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
1. Introdution --<br/> |
| -- |
2. How the Simplex method works --<br/> |
| -- |
3. Pitfalls and how to avoid them --<br/> |
| -- |
4. How fast is the Simplex method? --<br/> |
| -- |
5. The duality theorem --<br/> |
| -- |
6. Gaussian elimination and matrices --<br/> |
| -- |
7. The revised Simplex method --<br/> |
| -- |
8. General LP problems : Solutions by the Simplex method --<br/> |
| -- |
9. General LP problems : Theorems on duality and infeasibility --<br/> |
| -- |
10. Sensitivity analysis -- |
| -- |
11. Efficent allocation of scarce resources --<br/> |
| -- |
12. Scheduling production and inventory --<br/> |
| -- |
13. The cutting-stock problem --<br/> |
| -- |
14. Approximating data by linear functions --<br/> |
| -- |
15. Matrix games --<br/> |
| -- |
16. Systems of linear inequalities --<br/> |
| -- |
17. Connections with geometry --<br/> |
| -- |
18. Finding all vertices of a polyhedron -- |
| -- |
19. The network Simplex method --<br/> |
| -- |
20. Applications of the network Simplex method --<br/> |
| -- |
21. Upper-bounded transshipment problems --<br/> |
| -- |
22. Maximum flows through networks --<br/> |
| -- |
23. The primal-dual method -- |
| -- |
24. Updating a triangular factorization of the basis --<br/> |
| -- |
25. Generalized upper bounding --<br/> |
| -- |
26. The Dantzig-Wolfe decomposition principle. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
This comprehensive treatment of the fundamental ideas and principles of linear programming covers basic theory, selected applications, network flow problems, and advanced techniques. Using specific examples to illuminate practical and theoretical aspects of the subject, the author clearly reveals the structures of fully detailed proofs. The presentation is geared toward modern efficient implementations of the simplex method and appropriate data structures for network flow problems. Completely self-contained, it develops even elementary facts on linear equations and matrices from the beginning. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Linear programming |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Gratis, Gifts |
| 952 ## - LOCATION AND ITEM INFORMATION (KOHA) |
|---|
| -- |
1642 |
