Linear Programming Computation / / by Ping-Qi PAN
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Autore: |
PAN Ping-Qi
|
| Titolo: |
Linear Programming Computation / / by Ping-Qi PAN
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Edizione: | 1st ed. 2014. |
| Descrizione fisica: | 1 online resource (749 p.) |
| Disciplina: | 519.72 |
| Soggetto topico: | Matrix theory |
| Algebra | |
| Mathematics | |
| Economics | |
| Management science | |
| Linear and Multilinear Algebras, Matrix Theory | |
| Mathematics, general | |
| Economics, general | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references. |
| Nota di contenuto: | 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. |
| Sommario/riassunto: | 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. |
| Titolo autorizzato: | Linear programming computation |
| ISBN: | 3-642-40754-4 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910300157103321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |