Inverse Optimization: An Application to the Capacitated Plant Location Problem

DOI10.1287/MNSC.27.10.1120zbMath0465.90027OpenAlexW2052210854MaRDI QIDQ3917865

Jeremy F. Shapiro, Gabriel R. Bitran, Dorothy E. Sempolinski, Vijaya Chandru

Publication date: 1981

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

Full work available at URL: http://hdl.handle.net/1721.1/5161

zbMATH Keywords

parametric methodscomputational experiencelogisticsinverse optimizationcapacitated plant location problemLagrangean techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items (11)

A Lagrangian heuristic for the capacitated plant location problem with single source constraints ⋮ An algorithm for solving large capacitated warehouse location problems ⋮ Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems ⋮ Approximate solutions to large scale capacitated facility location problems ⋮ Heuristic algorithms for the inverse mixed integer linear programming problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A note on node aggregation and Benders' decomposition ⋮ Valid inequalities and facets of the capacitated plant location problem ⋮ Low earth orbit satellite based communication systems -- research opportunities ⋮ A generalized model of sequential decisionmaking under risk ⋮ A heuristic lagrangean algorithm for the capacitated plant location problem

This page was built for publication: Inverse Optimization: An Application to the Capacitated Plant Location Problem