Поиск по сайту


   
Дополнительные параметры поиска

Результаты поиска ( Отсортировано по релевантности | Сортировать по дате )


Search for feasible solutions by interior point algorithms

... 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
Раздел: ИСЭМ СО РАН


Телефоны

основной    +7(3952) 500-646
приемная    +7(3952) 42-47-00
факс     +7(3952) 42-67-96
Смотреть справочник