Journal ArticleDOI
A Primal Approach To the Simple Plant Location Problem
Reads0
Chats0
TLDR
This work proposes a primal subgradient algorithm to solve the well-known strong linear programming relaxation of the problem, and shows that an optimal solution is discovered with high frequency.Abstract:
The most successful algorithms for solving simple plant location problems are presently dual-based procedures. However, primal procedures have distinct practical advantages (e.g., in sensitivity analysis). We propose a primal subgradient algorithm to solve the well-known strong linear programming relaxation of the problem. Typically this algorithm converges very fast to a point whose objective value is close to the integer optimum and where most of the decision variables have been fixed either to 0 or to 1. To fix the values of the remaining variables we use a greedy-interchange algorithm. Thus we propose thiss approach as a heuristic. Computational experience shows that an optimal solution is discovered with high frequency.read more
Citations
More filters
Journal ArticleDOI
The volume algorithm: producing primal solutions with a subgradient method
Francisco Barahona,Ranga Anbil +1 more
TL;DR: An extension to the subgradient algorithm to produce primal as well as dual solutions based on a new theorem in linear programming duality is presented, which gives a fast method for producing approximations for large scale linear programs.
Journal ArticleDOI
Long- and short-term interest rates in a risky world☆
Angelo Mascaro,Allan H Meltzer +1 more
TL;DR: The authors developed and tested a general equilibrium model in which variability, or risk, affects the choice of portfolios and found that increased variability of unanticipated money growth raises demands for debt and money, and reduces the demand for real capital.
Journal ArticleDOI
Plant location with minimum inventory
TL;DR: This work has used subgradient optimization to accelerate the convergence of the D-W algorithm and presents the experience with problems arising in the design of a distribution network for computer spare parts.
Journal ArticleDOI
Branch and peg algorithms for the simple plant location problem
TL;DR: In this article, a branch and peg algorithm was proposed to solve the simple plant location problem, where pegging refers to fixing values of variables at each subproblem in the branch and bound tree.
Posted Content
Solving the simple plant location problem using a data correcting approach
TL;DR: This paper studies the efficiency of the data correcting approach using two different bounds, the Khachaturov-Minoux bound and the Erlenkotter bound, and presents computational results on several benchmark instances, which confirm the efficiencyof the data-correcting approach.