I. S. Litvinchev Abstracts of the 14th International Symposium on Mathematical Programming, Netherlands, 1991 , 01.1991 , p. 24, language: английский  Аннотация In this work a method of solving large-scale extreaml problems of optimal control in convex programming is described. To solve this, it is efficient to use decompositon based on variable aggregation.  Ключевые слова extremal problems, optimal control, decomposition, aggregation, convex programming