Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems

DOI10.1016/0377-2217(90)90299-QzbMath0719.90051MaRDI QIDQ2640440

Kongkiat Opaswongkarn, Monique Guignard

Publication date: 1990

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

zbMATH Keywords

Lagrangean relaxationvalid inequalitiescapacitated plant locationLagrangean dual ascent technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Dynamic supply chain design with inventory, Lagrangean decomposition: A model yielding stronger lagrangean bounds, A Lagrangean dual ascent algorithm for simple plant location problems, Analysis of relaxations for the multi-item capacitated lot-sizing problem, An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, The capacitated distribution and waste disposal problem, An application-oriented guide for designing Lagrangean dual ascent algorithms, A multiperiod two-echelon multicommodity capacitated plant location problem

Cites Work

• Unnamed Item
• A Lagrangean dual ascent algorithm for simple plant location problems
• A search tree algorithm for plant location problems
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A direct dual method for the mixed plant location problem with some side constraints
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Inverse Optimization: An Application to the Capacitated Plant Location Problem
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem