I. S. Litvinchev Abstracts of the 15th International Symposium on Mathematical Programming, Ann Arbor, USA, 1994 , 01.1994 , p. 31, language: английский  Аннотация In this work an approach is presented to esimate error bounds of aggreagtion in convex programming problems. This is obtained using interior point methods.  Ключевые слова aggregation, convex programming, error bounds

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