Zorkaltsev V.I. Entering into the Domain of Feasible Solutions Using Interior Point Method // Automation and Remote Control. Vol.80. No.2. 2019. P.348-361. DOI: 10.1134/S0005117919020127 The interior point algorithm for a linear programming problem is considered. The algorithm consists of two stages. At the first stage, we enter into the domain of feasible solutions for given constraints. The second stage lies in optimization over the feasible domain. Entering into the ...
Теги: interior point method , linear programming , automation , control engineering , feasible solution , interior point algorithm , interior-point method , linear programming problem , nondegenerate... the Memory of V.F. Demyanov), CNSA 2017 - Proceedings. 2017. ISBN (print): 9 781 509 062 607. DOI: 10.1109/CNSA.2017.7974038 The results of development, theoretical justification and experimental research of interior point algorithms for solving linear programming problems are presented in the article. © 2017 IEEE. нет
Теги: experimental research , interior point algorithm , interior-point method , linear programming problem , linear programmingZorkaltsev 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 ...
Теги: linear programming , optimization , consistent constraint , feasible regions , feasible solution , interior point , interior point algorithm , linear programming problem , non-degeneracy , algorithms
