Constraint Aggregation Principle: Application to a Dual Transportation Problem

R. Rozycki

Working Papers from International Institute for Applied Systems Analysis

Abstract: 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: 1995-09
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.iiasa.ac.at/Publications/Documents/WP-95-103.ps (application/postscript)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://www.iiasa.ac.at/Publications/Documents/WP-95-103.ps [301 Moved Permanently]--> https://www.iiasa.ac.at/Publications/Documents/WP-95-103.ps [301 Moved Permanently]--> https://iiasa.ac.at//Publications/Documents/WP-95-103.ps [302 Found]--> https://iiasa.ac.at/Publications/Documents/WP-95-103.ps)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wop:iasawp:wp95103

Access Statistics for this paper

More papers in Working Papers from International Institute for Applied Systems Analysis Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().