Linear Programming and Network flows – Mokhtar S. Bazaraa & John J. Jarvis, 1977, inbunden

Innehåll:

1. 1. Introduction
2. 2. Results from Linear Algebra and Convex Analysis
3. 3. The Simplex Method
4. 4. Starting Solution and Convergence
5. 5. Special Simplex Forms and Optimality Conditions
6. 6. Duality and Sensitivity
7. 7. The Decomposition Principle
8. 8. The Transportation and Assignment Problems
9. 9. Minimal Cost Network Flows
10. 10. The Out-of-Kilter Algorithm
11. 11. Maximal Flow, Shortest Path, and Multicommodity Flow Problems

Skick: Gott, pärmarna är dock något fläckiga och stötta, se bilder. Det kan finnas någon blyertsunderstrykning.