Mathematical Programming

, Volume 61, Issue 1–3, pp 75–87 | Cite as

An algorithm for solving convex programs with an additional convex—concave constraint

  • Dung Le Muu


An implementable decomposition method based on branch-and-bound techniques is proposed for finding a global optimal solution of certain convex programs with an additional convex—concave constrainth(x, y) ⩽ 0. A nonadaptive simplicial and an adaptive bisection are used for the branching operation, which is performed iny-space only. The bounding operation is based on a relaxation of the convex—concave constrainth(x, y) ⩽ 0. The algorithm can be applied efficiently for linear programs with an additional affine multiplicative constraint.

Key words

Global optimization branch-and-bound convex—concave constraint d.c. programming the product of two affine functions decomposition method algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C. Berge,Topological Spaces (Macmillan, New York, 1968).Google Scholar
  2. [2]
    C.A. Floudas and P.M. Paradalos,A Collection of Test Problems for Constrained Global Optimization Algorithms. Lecture Notes in Computer Science No. 455 (Springer, Berlin, 1990).Google Scholar
  3. [3]
    R.J. Hillestad and S.E. Jacobsen, “Reverse convex programming,”Applied Mathematics and Optimization 6 (1980) 68–78.Google Scholar
  4. [4]
    R. Horst, “An algorithm for nonconvex mathematical programming problems,”Mathematical Programming 10 (1976) 312–321.Google Scholar
  5. [5]
    R. Horst, “Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization, reverse convex constraints, d.c. programming, and Lipschitzian optimization,”Journal of Optimization Theory and Applications 58 (1988) 11–37.Google Scholar
  6. [6]
    R. Horst, N.V. Thoai, J. de Vries, “On finding new vertices and redundant constraints in cutting plane algorithms for global optimization,”Operations Research Letters 7 (1988) 85–90.Google Scholar
  7. [7]
    R. Horst and H. Tuy,Global Optimization: Deterministic Approaches (Springer, Berlin, 1990).Google Scholar
  8. [8]
    H. Konno and T. Kuno, “Linear multiplicative programming,” Preprint, Tokyo Institute of Technology (Tokyo, 1989).Google Scholar
  9. [9]
    Le D. Muu, “A convergent algorithm for solving linear programs with an additional reverse convex constraint,”Cybernetics (Prague) 81 (1985) 428–435.Google Scholar
  10. [10]
    Le D. Muu and W. Oettli, “An algorithm for infinite quadratic programming with convex constraints,”Operations Research Letters 10 (1991) 323–327.Google Scholar
  11. [11]
    Le D. Muu and W. Oettli, “A method for minimizing a convex—concave function over a convex set,”Journal of Optimization Theory and Applications 70 (1991) 377–384.Google Scholar
  12. [12]
    P.M. Pardalos, “Polynomial time algorithms for some classes of constrained non-convex quadratic problems,”Optimization 21 (1990) 843–853.Google Scholar
  13. [13]
    P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science No. 268 (Springer, Berlin, 1987).Google Scholar
  14. [14]
    R.T. Rockafellar, “Saddle functions and convex analysis,” in: H.W. Kuhn and G.P. Szegö, eds.,Differential Games and Related Topics (North-Holland, Amsterdam, 1971) pp. 109–128.Google Scholar
  15. [15]
    P.T. Thach, R.E. Burkard and W. Oettli, “Mathematical programs with a two-dimensional reverse convex constraint,”Journal of Global Optimization 1 (1991) 145–154.Google Scholar
  16. [16]
    P.T. Thach and H. Tuy, “The relief indicator method for constrained global optimization,”Naval Research Logistics 37 (1990) 473–497.Google Scholar
  17. [17]
    N.V. Thoai and H. Tuy, “Convergent algorithms for minimizing a concave function,”Mathematics of Operations Research 5 (1980) 556–566.Google Scholar
  18. [18]
    H. Tuy, “Convex programs with an additional reverse convex constraint,”Journal of Optimization Theory and Applications 52 (1987) 463–485.Google Scholar
  19. [19]
    H. Tuy, “Global minimization of a difference of two convex functions,”Mathematical Programming Study 30 (1987) 150–182.Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1993

Authors and Affiliations

  • Dung Le Muu
    • 1
  1. 1.Institute of MathematicsBo Ho, HanoiVietnam

Personalised recommendations