Delivery included to the United States

Linear Programming Computation

Linear Programming Computation

Paperback (03 Sep 2016)

  • $182.26
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

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.

Book information

ISBN: 9783662514306
Publisher: Springer Berlin Heidelberg
Imprint: Springer
Pub date:
DEWEY: 519.72
DEWEY edition: 23
Language: English
Number of pages: 747
Weight: 1057g
Height: 235mm
Width: 155mm
Spine width: 39mm