Linear Programming and Network Flows /
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Hoboken, N.J. :
John Wiley & Sons,
2010
|
| Edition: | Fourth edition |
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Call Number : | T 57.74 |
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | 106087 | ||
| 003 | MY-KlNDU | ||
| 005 | 20250702113959.0 | ||
| 006 | a|||| |||| 001 0 | ||
| 007 | ta | ||
| 008 | 090723s20102010njua b 001 0 eng d | ||
| 020 | |a 9780470462720 |q cloth | ||
| 020 | |a 0470462728 |q cloth | ||
| 040 | |a DLC |b eng |c MY-KlNDU |e rda | ||
| 050 | 0 | 0 | |a T 57.74 |
| 090 | |a T 57.74 |b .B39 2010 | ||
| 100 | 1 | |a Bazaraa, Mokhtar S., |e author | |
| 245 | 1 | 0 | |a Linear Programming and Network Flows / |c Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali. |
| 250 | |a Fourth edition | ||
| 264 | 1 | |a Hoboken, N.J. : |b John Wiley & Sons, |c 2010 | |
| 264 | 4 | |c ©2010 | |
| 300 | |a xiv, 748 pages : |b illustrations ; |c 25 cm | ||
| 336 | |a text |2 rdacontent | ||
| 337 | |a unmediated |2 rdamedia | ||
| 338 | |a volume |2 rdacarrier | ||
| 504 | |a Includes bibliographical references and index | ||
| 505 | 0 | |a Linear algebra, convex analysis, and polyhedral sets -- The simplex method -- Starting solution and convergence -- Special simplex implementations and optimality conditions -- Duality and sensitivity analysis -- The decomposition principle -- Complexity of the simplex algorithm and polynomial-time algorithms -- Minimal-cost network flows -- The transportation and assignment problems -- The out-of-kilter algorithm -- Maximal flow, shortest path, multicommodity flow, and network synthesis problems | |
| 650 | 0 | |a Linear programming | |
| 650 | 0 | |a Network analysis (Planning) | |
| 700 | 1 | |a Jarvis, John J., |e author | |
| 700 | 1 | |a Sherali, Hanif D., |d 1952- |e author | |
| 942 | |2 lcc |c 1 | ||
| 999 | |c 106087 |d 106087 | ||