Letter to the Editor—An Approach to Some Structured Linear Programming Problems

John M. Bennett and David R. Green
Additional contact information
John M. Bennett: University of Sydney, Sydney, Australia
David R. Green: University of Sydney, Sydney, Australia

Operations Research, 1969, vol. 17, issue 4, 749-750

Abstract: A recent paper by J. M. Bennett describes a decomposition algorithm for the class of linear programming problems commonly called “angular systems.” This note draws attention to a variant of the algorithm that is particularly suited to problems in which certain submatrices are sparse.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.4.749 (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:17:y:1969:i:4:p:749-750

Access Statistics for this article

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