Loading…

Reoptimization procedures for bounded variable primal simplex network algorithms

Many algorithms and applications call for the use of a network subprogram which must be optimized numerous times with slight changes to the problem data. Bound and right-hand-side changes to an existing basis tree may yield an infeasible basic solution. This report gives a sequence of steps that mod...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1986-02, Vol.23 (2), p.256-263
Main Authors: Ali, A.Iqbal, Allen, Ellen P., Barr, Richard S., Kennington, Jeffery L.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Many algorithms and applications call for the use of a network subprogram which must be optimized numerous times with slight changes to the problem data. Bound and right-hand-side changes to an existing basis tree may yield an infeasible basic solution. This report gives a sequence of steps that modify an existing basic solution to reflect such changes and streamline the reoptimization process.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(86)90245-6