Skip to main content
SpringerLink
Log in

A Branch-and-Bound Based Method for Solving Monotone Optimization Problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Monotone optimization problems are an important class of global optimization problems with various applications. In this paper, we propose a new exact method for monotone optimization problems. The method is of branch-and-bound framework that combines three basic strategies: partition, convexification and local search. The partition scheme is used to construct a union of subboxes that covers the boundary of the feasible region. The convexification outer approximation is then applied to each subbox to obtain an upper bound of the objective function on the subbox. The performance of the method can be further improved by incorporating the method with local search procedure. Illustrative examples describe how the method works. Computational results for small randomly generated problems are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.A. Abraham (1979) ArticleTitleAn improved algorithm for network reliability IEEE Transactions on Reliability R-28 58–61 Occurrence Handle10.1109/TR.1979.5220476

    Article  Google Scholar 

  2. M.S. Bazaraa H.D. Sherali C.M. Shetty (1993) Nonlinear Programming: Theory and Algorithms Wiley New York

    Google Scholar 

  3. H.P. Benson (1996) ArticleTitleDeterministic algorithm for constrained concave minimization: A unified critical survey Naval Research Logistics 43 765–795 Occurrence Handle10.1002/(SICI)1520-6750(199609)43:6<765::AID-NAV1>3.0.CO;2-2

    Article  Google Scholar 

  4. A. Birolini (1999) Reliability Engineering: Theory and Practice Springer-Verlag New York

    Google Scholar 

  5. A.M. Geoffrion (1967) ArticleTitleSolving bicriteria mathematical programs Operations Research 15 38–54 Occurrence Handle10.1287/opre.15.1.39

    Article  Google Scholar 

  6. D. Hochbaum (1995) ArticleTitleA nonlinear knapsack problem Operations Research Letters 17 103–110 Occurrence Handle10.1016/0167-6377(95)00009-9

    Article  Google Scholar 

  7. K.L.A. Hoffman (1981) ArticleTitleA method for globally minimizing concave functions over convex set Mathematical Programming 20 22–32 Occurrence Handle10.1007/BF01589330

    Article  Google Scholar 

  8. R. Horst H. Tuy (1993) Global Optimization: Deterministic Approaches Springer-Verlag Heidelberg

    Google Scholar 

  9. T. Ibaraki N. Katoh (1988) Resource Allocation Problems: Algorithmic Approaches MIT Press Cambridge, MA

    Google Scholar 

  10. M.S. Kodialam H. Luss (1998) ArticleTitleAlgorithm for separable nonlinear resource allocation problems Operations Research 46 272–284

    Google Scholar 

  11. D. Li X.L. Sun M.P. Biswal F. Gao (2001) ArticleTitleConvexification, concavification and monotonization in global optimization Annals of Operations Research 105 213–226 Occurrence Handle10.1023/A:1013313901854

    Article  Google Scholar 

  12. D. Li X.L. Sun K. McKinnon (2005) ArticleTitleAn exact solution method for reliability optimization in complex systems Annals of Operations Research 133 129–148 Occurrence Handle10.1007/s10479-004-5028-8

    Article  Google Scholar 

  13. A. Rubinov H. Tuy H. Mays (2001) ArticleTitleAn algorithm for monotonic global optimization problems Optimization 49 205–221

    Google Scholar 

  14. Sun, X.L., Luo, H.Z. and Li, D. (2004), Convexification of nonsmooth monotone functions, Technical report, Department of Mathematics, Shanghai University, Shanghai, P. R. China.

  15. X.L. Sun K.I.M. McKinnon D. Li (2001) ArticleTitleA convexification method for a class of global optimization problems with applications to reliability optimization Journal of Global Optimization 21 185–199 Occurrence Handle10.1023/A:1011962605464

    Article  Google Scholar 

  16. F.A. Tillman C.L. Hwuang W. Kuo (1980) Optimization of System Reliability Marcel Dekker New York

    Google Scholar 

  17. H. Tuy (2000) ArticleTitleMonotonic optimization: problems and solution approaches SIAM Journal on Optimization 11 464–494 Occurrence Handle10.1137/S1052623499359828

    Article  Google Scholar 

  18. H. Tuy L.T. Luc (2000) ArticleTitleA new approach to optimization under monotonic constraint Journal of Global Optimization 18 1–15 Occurrence Handle10.1023/A:1008321216723

    Article  Google Scholar 

  19. S.G. Tzafestas (1980) ArticleTitleOptimization of system reliability: A survey of problems and techniques International Journal of Systems Science 11 455–486

    Google Scholar 

  20. J.M. Zhang X.L. Sun (2003) ArticleTitleConvexification approximation method for monotone global optimization Communications on Applied Mathematics and Computations 17 18–26

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Shanghai University, 99 Shangda Road, Baoshan, Shanghai, 200444, P. R. China

    X. L. Sun & J. L. Li

  2. College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi, 530004, P. R. China

    J. L. Li

Authors
  1. X. L. Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. L. Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to X. L. Sun.

Additional information

Dedicated to Professor Alex Rubinov on the occasion of his 65th birthday. The authors appreciate very much the discussions with Professor Alex Rubinov and his suggestion of using local search. Research supported by the National Natural Science Foundation of China under Grants 10571116 and 10261001, and Guangxi University Scientific Research Foundation (No. X051022).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, X.L., Li, J.L. A Branch-and-Bound Based Method for Solving Monotone Optimization Problems. J Glob Optim 35, 367–385 (2006). https://doi.org/10.1007/s10898-005-3843-3

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-005-3843-3

Keywords

Search

Navigation