Linear Programming

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Michel Simonnard
Publisher: Prentice-Hall
Year: 1966

Language: English
Pages: 430+xxiv
City: Englewood Cliffs, NJ

Title
Translator's Note
Prefaces
Organization Chart
Contents
1. Definitions and Fundamental Properties
2. The Simplex Method. The Primal Simplex Algorithm, l: General Description
3. The Primal Simplex Algorithm, II: Initial Program, Convergence
4. The Revised Form of the Simplex Method. Comments on Techniques of Calculation
5. Duality
6. The Dual Simplex Algorithm. The Primal-Dual Method. Synthesis of the Algorithms
7. Problems of Post-Optimization. Parametric Programs
8. Linear Programming in Integers, I: Generalities, All Integer Programs
9. Linear Programming in Integers, II: Mixed Integer Programs, Examples, State of the Art
10. Bounded Variables. The Decomposition Principle of Dantzig and Wolfe
11. The Transportation Problem: The Simplex Method of Solution
12. Transportation Networks, I: Generalities, Maximal Flow
13. Transportation Networks, II: Constrained Flows
14. The Distribution Problem: Primal-Dual Method
15. Capacitated Transportation, Simple Transportation, and Assignment Problems: Primal-Dual Method
Appendix A: Review of Linear Algebra
Appendix B: Elementary Notions of Convex Polyhedra
Appendix C: Definitions Relating to Graphs
List of Symbols and Notation
English-French Glossary
Bibliography
Index