Mathematical Programming

, Volume 41, Issue 1–3, pp 249–260 | Cite as

A note on the solution of bilinear programming problems by reduction to concave minimization

  • Tran Vu Thieu


We present a new algorithm for solving the bilinear programming problem by reduction to concave minimization. This algorithm is finite, does not assume the boundedness of the constraint set, and uses an efficient procedure for checking whether a concave function is bounded below on a given halfline. Some preliminary computational experience with a computer code for implementing the algorithm on a microcomputer is also reported.

Key words

Outer-approximation algorithm bilinear programming problem concave minimization problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    F. Al-Khayyal and J.E. Falk, “Jointly constrained biconvex programming,”Mathematics of Operations Research 8 (1983) 273–286.Google Scholar
  2. [2]
    M. Altman, “Bilinear Programming,”Bulletin de l'Academie Polonaise des Sciences, 16 (1968) 741–746.Google Scholar
  3. [3]
    V.T. Ban, “A Finite Algorithm for Globally Minimizing a Concave Function under Linear Constraints and its Applications,” Proceedings of IFIP Working Conference on Recent Advances on System Modelling and Optimization, Hanoi, January 1983.Google Scholar
  4. [4]
    H.P. Benson, “A finite algorithm for concave minimization over a polyhedron,”Naval Research Logistics Quarterly 32 (1985) 165–177.Google Scholar
  5. [5]
    J.E. Falk, “A linear max-min problem,”Mathematical Programming 5 (1973) 169–188.Google Scholar
  6. [6]
    A.M. Frieze, “A bilinear programming formulation of the 3-dimensional assignment problem,”Mathematical Programming 7 (1974) 376–379.Google Scholar
  7. [7]
    G. Gallo and A. Ulkücü, “Bilinear programming: An exact algorithm,”Mathematical Programming 12 (1977) 173–194.Google Scholar
  8. [8]
    H. Konno, “Bilinear programming Part II: Applications of bilinear programming,” Technical Report 71-10, Dept. of OR, Stanford University (1971).Google Scholar
  9. [9]
    H. Konno, “A cutting plane algorithm for solving bilinear programs,”Mathematical Programming 11 (1976) 14–27.Google Scholar
  10. [10]
    O.L. Mangasarian, “Equilibrium points of bimatrix games,”SIAM Journal 12 (1964) 778–780.Google Scholar
  11. [11]
    O.L. Mangasarian and H. Stone, “Two person nonzero-sum games and quadratic programming,”Journal of Mathematical Analysis and Applications 9 (1964) 345–355.Google Scholar
  12. [12]
    R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).Google Scholar
  13. [13]
    H.D. Sherali and C.M. Shetty, “A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts,”Mathematical Programming 19 (1980) 14–31.Google Scholar
  14. [14]
    C.M. Shetty and H.D. Sherali, “Rectilinear distance location-allocation problem: A simplex based algorithm,” Proceedings of the International Symposium on Extreme Methods and Systems Analysis, Lecture Notes in Economics and Mathematical Systems (Springer, Berlin, 1980).Google Scholar
  15. [15]
    E.N. Sokirjanskaja, “Nekotorye algoritmy bilineinovo programmirovanija,”Kibernetika 4 (1974) 106–112.Google Scholar
  16. [16]
    R.M. Soland, “Optimal facility location with concave costs,”Operations Research 22 (1974) 373–382.Google Scholar
  17. [17]
    T.V. Thieu, “Relationship between bilinear programming and concave minimization under linear constraints,”Acta Mathematica Vietnamica 5 (1980) 106–113.Google Scholar
  18. [18]
    T.V. Thieu, “Computer program for concave minimization over a polytope,” Preprint No. 18, Institute of Mathematics, Hanoi 1983.Google Scholar
  19. [19]
    T.V. Thieu, “A finite method for globally minimizing concave functions over unbounded polyhedral convex sets and its applications,”Acta Mathematica Vietnamica 9 (1984) 173–191.Google Scholar
  20. [20]
    T.V. Thieu, B.T. Tam and V.T. Ban, “An outer approximation method for globally minimizing a concave function over a compact convex set,”Acta Mathematica Vietnamica, 8 (1983) 21–40.Google Scholar
  21. [21]
    H. Tuy, “Concave programming under linear constraints,”Doklady Akademiia Nauk USSR 159 (1964), 32–35. Translated inSoviet Mathematics Doklady 5 (1964) 1437–1440.Google Scholar
  22. [22]
    H. Tuy, “Global maximization of a convex function over a closed, convex, not necessarily bounded set,” Cahier de Math. de la Decision No. 8223 CEREMADE Université Paris-Dauphine (1982).Google Scholar
  23. [23]
    H. Tuy, “On outer approximation methods for solving concave minimization problems,”Acta Mathematica Vietnamica 8 (1983) 3–34.Google Scholar
  24. [24]
    H. Tuy, T.V. Thieu and Ng.Q. Thai, “A conical algorithm for globally minimizing a concave function over a closed convex set,”Mathematics of Operations Research 10 (1985) 498–514.Google Scholar
  25. [25]
    H. Vaish and C.M. Shetty, “The bilinear programming problem,”Naval Research Logistics Quarterly 23 (1976) 303–309.Google Scholar
  26. [26]
    H. Vaish and C.M. Shetty, “A cutting plane algorithm for the bilinear programming problem,”Naval Research Logistics Quarterly 24 (1977) 83–94.Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1988

Authors and Affiliations

  • Tran Vu Thieu
    • 1
  1. 1.Institute of MathematicsBo HoVietnam

Personalised recommendations