001454050 000__ 04653cam\a22005177i\4500
001454050 001__ 1454050
001454050 003__ OCoLC
001454050 005__ 20230314003458.0
001454050 006__ m\\\\\o\\d\\\\\\\\
001454050 007__ cr\cn\nnnunnun
001454050 008__ 230119s2023\\\\si\a\\\\ob\\\\001\0\eng\d
001454050 019__ $$a1356794077$$a1356796030$$a1357014575
001454050 020__ $$a9789811901478$$qelectronic book
001454050 020__ $$a9811901473$$qelectronic book
001454050 020__ $$z9789811901461
001454050 020__ $$z9811901465
001454050 0247_ $$a10.1007/978-981-19-0147-8$$2doi
001454050 035__ $$aSP(OCoLC)1362529488
001454050 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP$$dOCLCQ$$dYDX
001454050 049__ $$aISEA
001454050 050_4 $$aT57.74$$b.P36 2023
001454050 08204 $$a519.7/2$$223/eng/20230119
001454050 1001_ $$aPan, Ping-Qi,$$eauthor.
001454050 24510 $$aLinear programming computation /$$cPing-Qi Pan.
001454050 250__ $$aSecond edition.
001454050 264_1 $$aSingapore :$$bSpringer,$$c2023.
001454050 300__ $$a1 online resource (1 volume) :$$billustrations (black and white).
001454050 336__ $$atext$$btxt$$2rdacontent
001454050 337__ $$acomputer$$bc$$2rdamedia
001454050 338__ $$aonline resource$$bcr$$2rdacarrier
001454050 500__ $$aPrevious edition: 2014.
001454050 504__ $$aIncludes bibliographical references and index.
001454050 5050_ $$aChapter 1. Introduction -- Chapter 2. Geometry of Feasible Region -- Chapter 3. Simplex Method -- Chapter 4. Implementation of Simplex Method -- Chapter 5. Duality Principle and Dual Simplex Method -- Chapter 6. Primal-Dual Simplex Method -- Chapter 7. Sensitivity Analysis and Parametric LP -- Chapter 8. Generalized Simplex Method -- Chapter 9. Decomposition Method -- Chapter 10. Interior-Point Method -- Chapter 11. Integer Linear Programming (ILP) -- Chapter 12. Pivot Rule -- Chapter 13. Dual Pivot Rule -- Chapter 14. Simplex Phase-I Method -- Chapter 15. Dual Simplex Phase-l Method -- Chapter 16. Reduced Simplex Method -- Chapter 17. D-Reduced Simplex Method -- Chapter 18. Generalized Reduced Simplex Method -- Chapter 19. Deficient-Basis Method -- Chapter 20. Dual Decient-Basis Method -- Chapter 21. Face Method with Cholesky Factorization -- Chapter 22. Dual Face Method with Cholesky Factorization -- Chapter 23. Face Method with LU Factorization -- Chapter 24. Dual Face Method with LU Factorization -- Chapter 25. Simplex Interior-Point Method -- Chapter 26. Facial Interior-Point Method -- Chapter 27. Decomposition Principle.
001454050 506__ $$aAccess limited to authorized users.
001454050 520__ $$aOrganized into two volumes. this book represents a real breakthrough in the field of linear programming (LP). The first volume addresses fundamentals, including geometry of feasible region, simplex method, implementation of simplex method, duality and dual simplex method, sensitivity analysis and parametric LP, generalized simplex method, decomposition method, interior-point method and integer LP method, as well as reflects the state of art by highlighting new results, such as efficient primal and dual pivot rules, primal and dual Phase-I methods. The second volume introduces contributions of the author himself, such as reduced and D-reduced-simplex methods, generalized reduced and dual reduced simplex methods, deficient-basis and dual deficient-basis-simplex methods, and face and dual face methods with Cholesky factorization, as well as with LU factorization. As a monograph, this book is a rare work in LP, containing many noval ideas and methods, supported by complete computational results. As revealed from the perspective of theory, the most recently achieved results, such as reduced and D-reduced simplex methods, as well as ILP solvers--- controlled-cut and controlled-branch methods, are very significant and promising, though there are no computational results available at this stage. With a focus on computation, the content of this book ranges from simple to profound, clear and fresh. In particular, all algorithms are accompanied by examples for demonstration whenever possible. As a milestone of LP, this book is an indispensable tool for undergraduate and graduate students, teachers, practitioners and researchers, in LP and related fields.
001454050 588__ $$aDescription based on print version record.
001454050 650_0 $$aLinear programming.
001454050 650_6 $$aProgrammation linéaire.$$0(CaQQLa)201-0071999
001454050 655_0 $$aElectronic books.
001454050 77608 $$iPrint version:$$aPan, Ping-Qi.$$tLinear programming computation.$$bSecond edition.$$dSingapore : Springer, 2022$$z9789811901461$$w(OCoLC)1308480000
001454050 852__ $$bebk
001454050 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-981-19-0147-8$$zOnline Access$$91397441.1
001454050 909CO $$ooai:library.usi.edu:1454050$$pGLOBAL_SET
001454050 980__ $$aBIB
001454050 980__ $$aEBOOK
001454050 982__ $$aEbook
001454050 983__ $$aOnline
001454050 994__ $$a92$$bISE