Optimal expansion of capacitated transshipment networks

DOI10.1016/S0377-2217(96)90072-7zbMath0908.90116MaRDI QIDQ1266668

S. K. Gupta, J. L. Batra, Ravindra K. Ahuja, Abraham P. Punnen

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

simplex methodparametric analysiscapacity expansionpiecewise linear convex functionstransshipment network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (6)

Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales ⋮ Minimum cost-reliability ratio path problem ⋮ Topological expansion of multiple-ring metropolitan area networks ⋮ A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints ⋮ Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem

Uses Software

• XMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• Multiobjective programming and planning
• An algorithm for optimizing network flow capacity under economies of scale
• Increasing the Capacity of a Network: The Parametric Budget Problem
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Optimal expansion of an existing network

This page was built for publication: Optimal expansion of capacitated transshipment networks