Mathematical programming with iterative aggregation (Q1175776)

The paper deals with the aggregation of variables and constraints in linear programming problems and presents an algorithm based on iterative aggregation using augmented Lagrangians. The algorithm has some relations to earlier algorithms by \textit{I. Vakhutinsky}, \textit{L. Dudkin} and \textit{A. Ryvkin} [Econometrica 47, 821-841 (1979; Zbl 0429.90037)], \textit{R. Mendelssohn} [Oper. Res. 30, 62-73 (1982; Zbl 0481.90090)], and \textit{P. Zipkin} [``Aggregation in linear programming'', Ph. D. Diss. Yale Univ. 1977], but the statement of the problem differs from them by using an \(\epsilon\) term added to the augmented Lagrangian.