Linear Programming Computation

Linear Programming Computation

PAN, Ping-Qi

Springer Verlag, Singapore

01/2023

737

Dura

Inglês

9789811901461

15 a 20 dias

1522

Descrição não disponível.
Chapter 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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
deficient-basis method;duality and dual simplex method;face method;linear programming;reduced simplex method;simplex method;large-scale problem;simlex feasible-point method;dual face method