Technical Note—On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients

S. Selcuk Erenguc and Harold P. Benson
Additional contact information
S. Selcuk Erenguc: University of Florida, Gainesville, Florida
Harold P. Benson: University of Florida, Gainesville, Florida

Operations Research, 1986, vol. 34, issue 4, 650-653

Abstract: Recently, B. Faaland has developed a weighted selection algorithm for certain linear programming problems with nested constraint coefficients. The purpose of this note is to present a direct, concise proof of validity of Faaland's weighted selection algorithm that does not use graph theory or duality theory.

Keywords: 638; weighted; selection (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.4.650 (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:34:y:1986:i:4:p:650-653

Access Statistics for this article

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