Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Linear programming computation / Ping-Qi Pan.

By: Material type: TextTextPublication details: Berlin : Springer-Verlag, 2014.Description: xviii, 747 p. : illustrations ; 24 cmISBN:
  • 9783642407536
Subject(s): DDC classification:
  • 519.72 23 P187
Contents:
1. Introduction -- 2. Geometry of the Feasible Region -- 3. Simplex Method -- 4. Duality principle and dual simplex method -- 5. Implementation of the Simplex Method -- 6. Sensitivity Analysis and Parametric LP -- 7. Variants of the Simplex Method -- 8. Decomposition Method -- 9. Interior Point Method -- 10. Integer Linear Programming (ILP) -- 11. Pivot Rule -- 12. Dual Pivot Rule -- 13. Simplex Phase-I Method -- 14. Dual Simplex Phase-l Method -- 15. Reduced Simplex Method -- 16. Improved Reduced Simplex Method -- 17. D-Reduced Simplex Method -- 18. Criss-Cross Simplex Method -- 19. Generalizing Reduced Simplex Method -- 20. Deficient-Basis Method -- 21. Dual Deficient-Basis Method -- 22. Face Method -- 23. Dual Face Method -- 24. Pivotal interior-point Method -- 25. Special Topics -- Appendices -- References.
Summary: With emphasis on computation, this book is a real breakthrough in the field of LP. In addition to conventional topics, such as the simplex method, duality, and interior-point methods, all deduced in a fresh and clear manner, it introduces the state of the art by highlighting brand-new and advanced results, including efficient pivot rules, Phase-I approaches, reduced simplex methods, deficient-basis methods, face methods, and pivotal interior-point methods. In particular, it covers the determination of the optimal solution set, feasible-point simplex method, decomposition principle for solving large-scale problems, controlled-branch method based on generalized reduced simplex framework for solving integer LP problems.
Tags from this library: No tags from this library for this title. Log in to add tags.

Includes bibliographical references.

1. Introduction --
2. Geometry of the Feasible Region --
3. Simplex Method --
4. Duality principle and dual simplex method --
5. Implementation of the Simplex Method --
6. Sensitivity Analysis and Parametric LP --
7. Variants of the Simplex Method --
8. Decomposition Method --
9. Interior Point Method --
10. Integer Linear Programming (ILP) --
11. Pivot Rule --
12. Dual Pivot Rule --
13. Simplex Phase-I Method --
14. Dual Simplex Phase-l Method --
15. Reduced Simplex Method --
16. Improved Reduced Simplex Method --
17. D-Reduced Simplex Method --
18. Criss-Cross Simplex Method --
19. Generalizing Reduced Simplex Method --
20. Deficient-Basis Method --
21. Dual Deficient-Basis Method --
22. Face Method --
23. Dual Face Method --
24. Pivotal interior-point Method --
25. Special Topics --
Appendices --
References.

With emphasis on computation, this book is a real breakthrough in the field of LP. In addition to conventional topics, such as the simplex method, duality, and interior-point methods, all deduced in a fresh and clear manner, it introduces the state of the art by highlighting brand-new and advanced results, including efficient pivot rules, Phase-I approaches, reduced simplex methods, deficient-basis methods, face methods, and pivotal interior-point methods. In particular, it covers the determination of the optimal solution set, feasible-point simplex method, decomposition principle for solving large-scale problems, controlled-branch method based on generalized reduced simplex framework for solving integer LP problems.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in