... optimization process of an extended problem. This extension is performed by adding a new variable. The main objective of the paper is a theoretical justification of the procedure of entering the feasible region of the original problem under the assumption of non-degeneracy of the extended problem. Specifically, it is proved that under consistent constraints of the original problemthe procedure leads to a relative interior point of the feasible region. © 2016, Pleiades Publishing, Ltd. входит
Теги: linear programming , optimization , consistent constraint , feasible regions , feasible solution , interior point , interior point algorithm , linear programming problem , non-degeneracy , algorithms
