Technical Note—An Efficient Approach to Some Cases of Coefficient Variations in Linear Programs

Andrés Weintraub and William Ingram
Additional contact information
Andrés Weintraub: Universidad de Chile, Santiago, Chile
William Ingram: Technekron, Berkeley, California

Operations Research, 1981, vol. 29, issue 3, 609-611

Abstract: In some cases, a series of linear programs are run in sequence where a set of coefficients in the constraint matrix or in the right hand side is varied in such a way that inequality constraints are relaxed from one run to the next. For this type of variation we present an algorithm that determines in at most K pivots a new feasible solution, if K coefficients are varied. This algorithm relies on post optimality options of linear programming packages. In addition the algorithm proved to be advantageous in determining optimal solutions to the modified problems.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.3.609 (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:29:y:1981:i:3:p:609-611

Access Statistics for this article

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