Localization of the optimal solution and apriori bounds for aggregation

Общая информация

 Аннотация

    Ellipsoids are proposed that contain optimal solutions of the primal and/or dual linear programming problem and do not depend on the method used to solve the original formulation. The ellipsoids are used to formulate criteria for identifying the optimal basic and nonbasic variables.

 Ключевые слова

    optimal solutions, linear programming problem, interior-point methods, eliipsoids
 

Home page
Наш адрес:
119991 ГСП-1 Москва В-71, Ленинский просп., 14
Телефон: 938-0309 (Справ. бюро)
Факс: (495)954-3320 (Лен.пр.,14), (495)938-1844 (Лен.пр.,32а)
Назад