A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy

DOI10.1287/trsc.23.4.231zbMath0696.90076OpenAlexW2081714993WikidataQ115213135 ScholiaQ115213135MaRDI QIDQ3474495

Warren B. Powell

Publication date: 1989

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.23.4.231

zbMATH Keywords

approximationdirectional derivativesshadow pricesreduced costleast-cost flow augmenting pathslinear transshipment network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (6)

Approximate dynamic programming for lateral transshipment problems in multi-location inventory systems ⋮ A least-squares minimum-cost network flow algorithm ⋮ Sensitivity analysis of the optimal assignment. ⋮ Multifleet routing and multistop flight scheduling for schedule perturbation ⋮ A passenger demand model for airline flight scheduling and fleet routing ⋮ Multicommodity network flows: The impact of formulation on decomposition

This page was built for publication: A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy