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

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

The $\epsilon$-Symmetric Relation Between the Lagrangean Relaxation and the Benders' Decomposition for Large Scale Mixed Integer Programming

대규모 혼합전수계획 문제를 풀기 위한 라구랑지 이완기법과 벤더스 분할기법과의 대칭적 관계

  • Published : 1989.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

We in this paper have defined the concept of .epsilon.-symmetric relation between the Lagrangean relaxation and the Benders' decomposition. This links the solutions of the Lagrangean subproblems and those of the Benders' subproblems even under positive duality gaps. As an application we have discussed the reduction of the size for a special class of problems.

Keywords

References

  1. Numeriche Mathematik v.4 Partitioning procedures for solving mixed variable programming problems Benders,J.F.
  2. Management Science v.23 Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms Cornuejols,G.;M.L.Fisher;G.L.Nemhauser
  3. Mathematical Programming v.11 A dual algorithm for the one machine scheduling problem Fisher,M.L.
  4. Management Science v.27 The Lagrangean relaxation method for solving integer programming problems Fisher,M.L.
  5. Mathematical Programming Study v.2 Lagrangean relaxation and its uses in integer programming Geoffrion,A.M.
  6. Operations Research v.18 The traveling salesman problem and minimum spanning trees Held,M.;R.M.Karp
  7. Mathematical Programming v.1 The traveling salesman problem and minimum spanning trees: Part II Held,M.;R.M.Karp
  8. Report No.7418-OR Integer programming in continuous variables Johnson,E.L.
  9. Journal of the Operations Research Society of Japan v.32 A simplified cross decomposition algorithm for multiple right hand choice linear programming Kim,S.;S.Cho;B.Um
  10. Mathematical Programming v.26 An ideal column algorithm for interger programs with special ordered sets of variable Martin,R.K.;D.J.Sweeny
  11. Soviet Mathematics Doklady v.8 A general method of solving extremum problems Polyak,B.T.
  12. USSR Computational Mathematics and Mathematical Physics v.9 Minimization of unsmooth functionals Polyak,B.T.
  13. Minimization methods for nondifferentiable functions Shor,N.Z.
  14. Mathematical Programming v.25 Cross decomposition for mixed integer programming Van Roy,T.J.
  15. Model building in mathematical programming Williams,H.P.