Logo - springer
Slogan - springer

Mathematics - Algebra | Linear Programming Computation

Linear Programming Computation

PAN, Ping-Qi

2014, XVIII, 747 p. 14 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$149.00

(net) price for USA

ISBN 978-3-642-40754-3

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$189.00

(net) price for USA

ISBN 978-3-642-40753-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • A landmark work on LP
  • Includes a wealth of rich and advanced materials
  • A must-read for all students, researchers and practitioners interested in LP and related areas
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.

Content Level » Research

Keywords » deficient-basis method - duality - face method - linear programming - reduced simplex method - simplex method

Related subjects » Algebra - Economics - Mathematics

Table of contents / Preface / Sample pages 

Distribution rights 

Distribution rights for India: Researchco Book Centre, New Delhi, India

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Linear and Multilinear Algebras, Matrix Theory.