A hierarchical Lagrangean relaxation procedure for solving midterm planning problems

An efficient decomposition procedure for solving midterm planning problems is developed based on Lagrangean relaxation. The basic idea of the proposed solution technique is the successive partitioning of the original problem into smaller, more computationally tractable subproblems by hierarchical relaxation of key complicating constraints. The systematic identification of these complicating constraints is accomplished by utilizing linear programming relaxation dual-multiplier information. This hierarchical Lagrangean relaxation procedure, along with an upper bound generating heuristic, is incorporated within a subgradient optimization framework. This solution strategy is found to be much more effective, in terms of both quality of solution and computational requirements, than commercial mixed-integer linear programming solvers in bracketing the optimal value, especially for larger problems.