000			04143nam a22003735i 4500
999			_c398302 _d398302 _x1
001			398302
003			ES-MaUEC
005			20240429180416.0
006			a|||| o|||| 00| 0
007			cr nn 008mamaa
008			221230s2023 si | o |||| 0|eng d
020			_a9789811901478
024	7		_a10.1007/978-981-19-0147-8 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aT57.74 _b2023 EB
100	1		_aPan, Ping-Qi _eautor _4http://id.loc.gov/vocabulary/relators/aut _9689552
245	1	0	_aLinear Programming Computation _cby Ping-Qi PAN
250			_a2nd ed 2023
264		1	_aSingapore _bSpringer Nature _c2023
300			_a1 recurso en línea
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_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.
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.
988			_aSpringer_Computer_2023
650		7	_2embne _9143837 _aProgramación lineal
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-981-19-0147-8 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2024 _dz _eIG _zSI