I. S. Litvinchev Journal of Computational and Applied Mathematics , v.61, N2 , 01.1995 , p. 117-137, language: английский  Аннотация A new approach is proposed for the solution of large-scale constrained optimal control problems governed by ordinary differential equations. The method is intended for problems where the main difficulty is the large number of controls and hard control constraints. A typical example of such a system is a dynamical resource allocation problem. The method is based on aggregation-disaggregation ideas and is within the class of feasible decomposition methods. The aggregation is applied to the controls. It is shown that the problem of updating the disaggregation in each iteration decomposes into independent subproblems of lower dimension. If the original problem has block- or block-separable structure, then the subproblems are formulated according to the blocks. Numerical examples to illustrate the method are given.  Ключевые слова numerical examples; large-scale constrained optimal control problems; dynamical resource allocation problem; feasible decomposition methods; aggregation; updating; disaggregation; iteration