Linear Programming Computation

AvPing-Qi PAN

Häftad, Engelska, 2016

1 506 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Övrigt

3 545 kr

Övrigt

3 545 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2016-09-03
Mått:155 x 235 x 41 mm
Vikt:1 142 g
Format:Häftad
Språk:Engelska
Antal sidor:747
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783662514306

Utforska kategorier

Nationalekonomi inom Ekonomi och Ledarskap
Matematik inom Naturvetenskap och teknik
Algebra inom Naturvetenskap och teknik

Recensioner i media

From the book reviews: "The book seems to be mainly addressed to scientists who already possess some expertise in LP. The kind of presentation, however, also allows using parts of it as a basis for a course on the topic. In fact, a special feature of the book is that an algorithm typically is accompanied by some example for which the results of all computational steps needed to find a solution are written down." (Rembert Reemtsen, zbMATH, Vol. 1302, 2015) "This book is a research monograph focusing on computational techniques in the simplex method for linear programming. ... It may be of interest to researchers and developers of simplex method codes for linear programming." (B. Borchers, Choice, Vol. 52 (3), November, 2014)

Innehållsförteckning

Introduction.- Geometry of the Feasible Region.- Simplex Method.- Duality principle and dual simplex method.- Implementation of the Simplex Method.- Sensitivity Analysis and Parametric LP.- Variants of the Simplex Method.- Decomposition Method.- Interior Point Method.- Integer Linear Programming (ILP).- Pivot Rule.- Dual Pivot Rule.- Simplex Phase-I Method.- Dual Simplex Phase-l Method.- Reduced Simplex Method.- Improved Reduced Simplex Method.- D-Reduced Simplex Method.- Criss-Cross Simplex Method.- Generalizing Reduced Simplex Method.- Deficient-Basis Method.- Dual Deficient-Basis Method.- Face Method.- Dual Face Method.- Pivotal interior-point Method.- Special Topics.- Appendix.- References.