Advertisement

Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

  • Le Dung Muu
  • Thai Quynh Phong
  • Pham Dinh Tao
Article

Abstract

We develop convergent decomposition branch and bound algorithms for solving a class of bilinear programming problems. As an application of the proposed method, we apply it to quadratic programs with a few negative eigenvalues, and to a class of mixed integer programming problems.

Keywords

bilinear programming quadratic minimization quadratic mixed integer decomposition method adaptive bisection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F.A. Al-Khayyal and J.E. Falk, “Jointly constrained biconvex programming,” Mathematics of Operations Research, Vol. 8 pp. 273–286, 1983.Google Scholar
  2. 2.
    R. Horst and H. Tuy, “Global Optimization: Deterministic Approaches,” 2 edition Berlin, New York: Springer-Verlag, 1993.Google Scholar
  3. 3.
    H. Konno, “A cutting plane algorithm for solving bilinear programs,” Mathematical Programming, Vol. 11, pp. 14–27, 1976.Google Scholar
  4. 4.
    L.D. Muu and W. Oettli, “A method for minimizing a convex—concave function over a convex set,” J. of Optimization Theory and Applications, Vol. 70 pp. 337–384, 1991.Google Scholar
  5. 5.
    L.D. Muu and W. Oettli. “Combined branch and bound and cutting plane methods for solving a class of nonlinear programming problems,” J. of Global Optimization, Vol. 3, pp. 377–391, 1993.Google Scholar
  6. 6.
    L.D. Muu and B.T. Tam, “Efficient methods for solving certain bilinear programming problem,” to appear in Acta Mathematica Vietnamica.Google Scholar
  7. 7.
    P.M. Pardalos and J.B. Rosen, “Constrained global optimization: Algorithms and applications,” in G. Goos and J. Hartmans, editors, Lecture Notes in Computer Science, number 268. Berlin: Springer-Verlag, 1987.Google Scholar
  8. 8.
    P.M. Pardalos and S.A. Vavasis, “Quadratic programming with one negative eigenvalue is NP-hard,” J. of Global Optimization, Vol. 21, pp. 843–855, 1991.Google Scholar
  9. 9.
    A.T. Phillips and J.B. Rosen, “A parallel algorithm for constrained concave quadratic global minimization,” Mathematical Programming, Vol. 42, pp. 412–448, 1988.Google Scholar
  10. 10.
    T.Q. Phong, L.T.H. An, and Pham D. Tao, “On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method,” (submitted).Google Scholar
  11. 11.
    H.D. Sherali and A. Alameddine, “A new reformulation—linearization technique for bilinear programming problems,” J. of Global Optimization, Vol. 2, pp. 379–410, 1992.Google Scholar
  12. 12.
    H.D. Sherali and C.M. Shetty, “A finitely convergent algorithm for bilinear programming problem using polar cuts and disjunctive face cuts,” Mathematical Programming, Vol. 19, pp. 379–410, 1980.Google Scholar
  13. 13.
    Pham D. Tao “Un algorithme pour la résolution du programme linéaire général,” RAIRO-Recherche opérationnelle, Vol. 25, pp. 183–201, 1991.Google Scholar
  14. 14.
    T.V. Thieu, “Relationship between bilinear programming and concave programming,” Acta Mathematica Vietnamica, Vol. 2, pp. 106–113 (1980).Google Scholar
  15. 15.
    N. V. Thoai and H. Tuy, “Convergent algorithms for minimizing a concave function,” Mathematics of Operations Research, Vol. 5 pp. 556–566 (1980).Google Scholar
  16. 16.
    H. Vaish and C.M. Shetty, “The bilinear programming problems,” Naval Res. Log. Quar., Vol. 23, pp. 303–319, 1976.Google Scholar
  17. 17.
    H. Vaish and C.M. Shetty, “A cutting plane algorithm for bilinear programming problems,” Naval Res. Log. Quar., Vol. 24, pp. 83–94, 1976.Google Scholar
  18. 18.
    Y. Yajima and H. Konno, “Efficient algorithm for solving rank two and rank three bilinear programming problems,” J. of Global Optimization, Vol. 1, pp. 155–173, 1991.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Le Dung Muu
    • 1
  • Thai Quynh Phong
    • 2
  • Pham Dinh Tao
    • 2
  1. 1.Institute of MathematicsHanoiVienam
  2. 2.LMI-INSA RouenMont Saint AignanFrance

Personalised recommendations