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

Published Online:https://doi.org/10.1287/opre.34.4.650

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.