New Bundle Methods for Solving Lagrangian Relaxation Dual Problems

  • X. Zhao
  • P.B. Luh


Bundle methods have been used frequently to solve nonsmooth optimization problems. In these methods, subgradient directions from past iterations are accumulated in a bundle, and a trial direction is obtained by performing quadratic programming based on the information contained in the bundle. A line search is then performed along the trial direction, generating a serious step if the function value is improved by ∈ or a null step otherwise. Bundle methods have been used to maximize the nonsmooth dual function in Lagrangian relaxation for integer optimization problems, where the subgradients are obtained by minimizing the performance index of the relaxed problem. This paper improves bundle methods by making good use of near-minimum solutions that are obtained while solving the relaxed problem. The bundle information is thus enriched, leading to better search directions and less number of null steps. Furthermore, a simplified bundle method is developed, where a fuzzy rule is used to combine linearly directions from near-minimum solutions, replacing quadratic programming and line search. When the simplified bundle method is specialized to an important class of problems where the relaxed problem can be solved by using dynamic programming, fuzzy dynamic programming is developed to obtain efficiently near-optimal solutions and their weights for the linear combination. This method is then applied to job shop scheduling problems, leading to better performance than previously reported in the literature.

Lagrangian relaxation bundle methods nonsmooth optimization manufacturing scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    GEOFFRION, M., Lagrangian Relaxation for Integer Programming, Mathematical Programming Studies, North Holland, Amsterdam, Netherlands, pp. 82-114, 1974.Google Scholar
  2. 2.
    BERTSEKAS, D. P., Nonlinear Programming, 2nd Edition, Athena Scientific, Belmont, Massachusetts, 1999.Google Scholar
  3. 3.
    ZHAO, X., LUH, P. B., and WANG, J., Surrogate Gradient Algorithm for Lagrangian Relaxation, Journal of Optimization Theory and Applications, Vol. 100, pp. 699-712, 1999.Google Scholar
  4. 4.
    KASKAVELIS, C. A., and CARAMANIS, M. C., Efficient Lagrangian Relaxation Algorithms for Industry Size Job-Shop Scheduling Problems, IIE Transactions, Vol. 30, pp. 1085-1097, 1998.Google Scholar
  5. 5.
    HIRIART-URRUTY, J. B., and LEMARECHAL, C., Convex Analysis and Minimization Algorithms, Vols. 1 and 2, Springer Verlag, Berlin, Germany, 1993.Google Scholar
  6. 6.
    NEMHAUSER, G., and WOLSEY, L., Integer and Combinatorial Optimization, John Wiley and Sons, New York, NY, 1988.Google Scholar
  7. 7.
    HELD, M., WOLFE, P., and CROWDER, H., Validation of Subgradient Optimization, Mathematical Programming, Vol. 6, pp. 62-88, 1974.Google Scholar
  8. 8.
    KIWIEL, K. C., Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization, SIAM Journal on Optimization, Vol. 6, pp. 227-249, 1996.Google Scholar
  9. 9.
    KOHL, N. and MADSEN, O. B. G., An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation, Operations Research, Vol. 45, pp. 395-406, 1997.Google Scholar
  10. 10.
    MIFFLIN, R., SUN, D., and QI, L., Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization, SIAM Journal on Optimization, Vol. 8, pp. 583-603, 1998.Google Scholar
  11. 11.
    WANG, J., LUH, P. B., ZHAO, X., and WANG, J., An Optimization-Based Algorithm for Job Shop Scheduling, Sadhana, Vol. 22, pp. 241-256, 1997.Google Scholar
  12. 12.
    BELLMAN, R., Applied Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1957.Google Scholar
  13. 13.
    KIWIEL, K. C., Proximal Level Bundle Methods for Convex Nondifferentiable Optimization, Saddle-Point Problems, and Variational Inequalities, Mathematical Programming, Vol. 69, pp. 89-109, 1995.Google Scholar
  14. 14.
    HOITOMT, D. J., LUH, P. B., and PATTIPATI, K. R., A Practical Approach to Job Shop Scheduling Problems, IEEE Transactions on Robotics and Automation, Vol. 9, pp. 1-13, 1993.Google Scholar

Copyright information

© Plenum Publishing Corporation 2002

Authors and Affiliations

  • X. Zhao
    • 1
  • P.B. Luh
    • 2
  1. 1.I2 TechnologiesCambridge
  2. 2.Department of Electrical and Computer Engineering, School of EngineeringUniversity of ConnecticutStorrs

Personalised recommendations