Zorkaltsev V.I. Search for feasible solutions by interior point algorithms // Numerical Analysis and Applications. Vol.9. No.3. 2016. P.191-206. DOI: 10.1134/S1995423916030022 A family of interior point algorithms for linear programming problems is considered. In these algorithms, entering the feasible solution region of the original problem is presented as an optimization process of an extended problem. This extension is performed by adding a new variable. The main objective of the paper is a theoretical...
Теги: linear programming , optimization , consistent constraint , feasible regions , feasible solution , interior point , interior point algorithm , linear programming problem , non-degeneracy , algorithms
