Solving large-scale linear programs by aggregation (Q581234)

This paper deals with the solution of linear programs via the use of aggregation. A sequence of smaller, aggregated problems are solved. At each iteration we develop lower and upper bounds on the objective value. If the solution is not acceptable, a scheme for modifying the aggregated problem is given. The procedure is computationally tested on problems with up to 200 variables/constraints.