I. S. Litvinchev Comput. Math. Math. Phys. , vol.33 No.8 , 01.1993 , p. 1007-1015, language: английский  Аннотация Inequalities are obtained for the difference between the optimum values of the objective function of initial and aggregated problems. Classes of problems for which computation of these bounds can be simplified are identified.  Ключевые слова convex programming, large-scale problems, aggregation