 Linear Programming and Network Flows, 3rd Edition
ISBN: 978-0-471-48599-5
Hardcover
744 pages
December 2004
US $127.50
 Add to Cart
This price is valid for United States. Change location to view local pricing and availability. |
Visit Wiley's Higher Education Site for:
Instructors may request an evaluation copy for this title.
|
One: Introduction.
Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.
Three: The Simplex Method.
Four: Starting Solution and Convergence.
Five: Special Simplex Implementations and Optimality Conditions.
Six: Duality and Sensitivity Analysis.
Seven: The Decomposition Principle.
Eight: Complexity of the Simplex Algorithms.
Nine: Minimal-Cost Network Flows.
Ten: The Transportation and Assignment Problems.
Eleven: The Out-of-Kilter Algorithm.
Twelve: Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems.
Bibliography.
Index.
