An Infeasibility-Pricing Decomposition Method for Linear Programs

Egon Balas

Operations Research, 1966, vol. 14, issue 5, 847-873

Abstract: This paper presents two versions of a method for solving large linear programs through decomposition. In both versions the problem is decomposed into subprograms as in the D antzig -W olfe model, but each version uses a different type of linking program. The subprograms are first solved, and then the infeasibility of the resulting solution for the linking program is used to generate a price-adjustment process (much like a market mechanism), which gradually corrects the objective functions of the subprograms, until either some optimal solutions to the latter yield a feasible solution to the linking program (then the problem is solved), or evidence is obtained that the problem has no feasible solution.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.5.847 (application/pdf)

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:inm:oropre:v:14:y:1966:i:5:p:847-873

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().