Constraint Aggregation Principle: Application to a Dual Transportation Problem
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.
|Date of creation:||Sep 1995|
|Date of revision:|
|Contact details of provider:|| Postal: A-2361 Laxenburg|
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Y.M. Ermoliev & A.V. Kryazhimskii & A. Ruszczynski, 1995. "Constraint Aggregation Principle in Convex Optimization," Working Papers wp95015, International Institute for Applied Systems Analysis.
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp95103. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.