Special Simplex Algorithm for Linked Problems

A. R. G. Heesterman and J. Sandee
Additional contact information
A. R. G. Heesterman: Central Planning Bureau, The Hague, Netherlands
J. Sandee: Central Planning Bureau, The Hague, Netherlands

Management Science, 1965, vol. 11, issue 3, 420-428

Abstract: This paper describes a variant of the Simplex algorithm, applicable to matrices containing blocks of elements along and just below the diagonal. It uses the emptiness of the other blocks to save space and computation.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.11.3.420 (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:ormnsc:v:11:y:1965:i:3:p:420-428

Access Statistics for this article

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