Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

AN APPLICATION OF LAGRANGIAN RELAXATION ALD SUBGRADIENT METHOD FOR A DYNAMIC UNCAPAITATED FACILITY COCATION PROBLEM

  • Song, Jae-Wook (Department of Industrial Engineering, R.O.K. Air Force Academy) ;
  • Kim, Sheung-Kown (Department of Industrial Engineering, Korea University)
  • Published : 1988.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

The dynamic uncapacitated facility location model is formulated by a mixed integer programming. It has the objective of minimizing total discounted costs for meeting demands specified in different time periods at various demand centers. Costs include those for operation of facilities to demand centers and a fixed cost associated with the capital investment. The problem is decomposed into two simple Lagrangian relaxed subproblems which are coordinated by Lagrangian multipliers. We explored the effect of using the subgradient optimization procedure and a viable solution approach is proposed. Computational results are presented and further research directions are discussed.

Keywords

References

  1. Operations Research v.14 A Branch-bound Algorithm for Plant Location Efroymson,M.A.;T.L.Ray
  2. Management Science v.22 Capacity Planning for Large Multilocation Systems : Approximate and Incomplete Dynamic Programming Approaches Erlenkotter,D.
  3. Operations Research v.26 no.6 A Dual-based Procedure for Uncapacitated Facility Location Erlenkotter,D.
  4. Management Science v.27 The Largrangian Relaxation Method for Solving Integer Programming Problems Fisher,M.L.
  5. Management Science v.22 Capacity Expansion with Two Producing Regions and Concave Costs Fong,C.O.;Rao,M.R.
  6. Management Science v.32 no.9 The Multiregion Dynamic Capacity Expansion Problem : An Improved Heuristic Fong,C.O.;V.Srinivasan
  7. Mathermatical Programming Study v.2 Lagrangean Relaxtion for Interger Programming Geoffrion,A.M.
  8. Mathermatical Programming v.6 Validation of Subgradient Optimization Held,M.;Wolfe,P.;Crowder,H.P.
  9. The Technical University of Denmark DK-2800 Lyngby, Working Paper Heuristic Procedures for Dynamic Plant Location Jacobsen,S.
  10. Water Resources Research v.22 no.8 A Heuristic Solution Procedure for Expansion Sequencing Problems Kim,S.K.;Yeh,W.W.
  11. Management Science v.18 An Efficient Branch and Bound Algorithm for the Warehouse Location Problem Khumawala,B.M.
  12. European Journal of Operations Research v.12 The simple plant location problem ; Survey and Synthesis Krarup,J.;P.M.Pruzan
  13. Investments for Capacity Expansion : Site, Location and Time-Phasing Manne,A.S.
  14. ALLE Transaction v.7 no.2 Optimal and Heuristic Facility Phase-out Strategies Roodman,G.M.;Schwartz,L.B.
  15. ALLE Transaction v.9 no.1 Extension of the Multiperiod Facility Phase-out Model : New Procedure and Application to a Phase-in/Phase-out Problem Roodman,G.M.;Schwartz,L.B.
  16. Management Science v.28 A Dual-Based Procedure for Dynamic Facility Location Van Roy,T.J.;Erlenkotter,D.
  17. Management Science v.28 no.1 The Multiperiod Location-Allocation Problem with Relocation fo Facilities Wesolowsky,G.O.;Truscott,W.G.