TY  - RPRT
CY  - IIASA, Laxenburg, Austria
ID  - iiasa4493
UR  - https://pure.iiasa.ac.at/id/eprint/4493/
A1  - Rozycki, R.
Y1  - 1995/09//
N2  - Constraint aggregation technique is a new method for solving convex optimization problems. This paper focuses on the examination of the efficiency of the aggregation technique. Some properties of the basic version of the algorithm are presented  for convex optimization problems with linear constraints.  Various parameters and advanced versions of this algorithm are examined  on the example of the dual transportation problem.  The results obtained allow to formulate some interesting conclusions.  Special attention is directed to the advantages achieved  by implementation of partial aggregation idea.
PB  - WP-95-103
M1  - working_paper
TI  - Constraint Aggregation Principle: Application to a Dual Transportation Problem
AV  - public
EP  - 20
ER  -