An Artificial-Variable Elimination Method for Solving Block-Diagonal Programming Problems

Thomas W. Knowles
Additional contact information
Thomas W. Knowles: Illinois Institute of Technology, Chicago, Illinois

Operations Research, 1973, vol. 21, issue 3, 712-727

Abstract: The algorithms of this paper solve problems of the “decomposition” structure. It presents the basic framework for a class of algorithms, along with two possible versions. The basic algorithm generates a sequence of solutions that satisfy complementary slackness with a sequence of dual feasible solutions such that, when the linking constraints are satisfied, an optimum is obtained. Computational experience is reported for the first version in comparison with RSMFOR, a simplex program, on randomly generated problems and a three-period refinery model. Using the number of nonzero multiplications as the basis for comparison, the results show the first version substantially better than the simplex method. The computational experience is discussed at some length.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.3.712 (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:21:y:1973:i:3:p:712-727

Access Statistics for this article

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