Parametric analysis of linear programs with upper bounded variables

S. S. Panwalkar

Naval Research Logistics Quarterly, 1973, vol. 20, issue 1, 83-93

Abstract: Linear programming problems with upper bounded variables can be solved by regular simplex method by considering upper bounding constraints as explicit constraints of the problem. However, more efficient methods exist which consider these upper bound constraints implicitly. When parametric analysis for problems with upper bounds is to be carried out, one can use the regular parameter analysis by considering the upper bound constraints explicitly. This paper develops formulas for parametric analysis where upper bound constraints are used implicitly, thus reducing the size of the basic matrix.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800200108

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:wly:navlog:v:20:y:1973:i:1:p:83-93

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().