0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Algebra

Buy Now

Linear Programming Computation (Paperback, Softcover reprint of the original 1st ed. 2014) Loot Price: R4,379
Discovery Miles 43 790
Linear Programming Computation (Paperback, Softcover reprint of the original 1st ed. 2014): Ping-Qi PAN

Linear Programming Computation (Paperback, Softcover reprint of the original 1st ed. 2014)

Ping-Qi PAN

 (sign in to rate)
Loot Price R4,379 Discovery Miles 43 790 | Repayment Terms: R410 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Release date: September 2016
First published: 2014
Authors: Ping-Qi PAN
Dimensions: 235 x 155 x 39mm (L x W x T)
Format: Paperback
Pages: 747
Edition: Softcover reprint of the original 1st ed. 2014
ISBN-13: 978-3-662-51430-6
Categories: Books > Business & Economics > Economics > General
Books > Science & Mathematics > Mathematics > Algebra > General
LSN: 3-662-51430-3
Barcode: 9783662514306

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners