## Abstract

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.

This is a preview of subscription content, access via your institution.

## References

F. Al-Khayyal and J.E. Falk, “Jointly constrained biconvex programming,”

*Mathematics of Operations Research*8 (1983) 273–286.M. Altman, “Bilinear Programming,”

*Bulletin de l'Academie Polonaise des Sciences*, 16 (1968) 741–746.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.

H.P. Benson, “A finite algorithm for concave minimization over a polyhedron,”

*Naval Research Logistics Quarterly*32 (1985) 165–177.J.E. Falk, “A linear max-min problem,”

*Mathematical Programming*5 (1973) 169–188.A.M. Frieze, “A bilinear programming formulation of the 3-dimensional assignment problem,”

*Mathematical Programming*7 (1974) 376–379.G. Gallo and A. Ulkücü, “Bilinear programming: An exact algorithm,”

*Mathematical Programming*12 (1977) 173–194.H. Konno, “Bilinear programming Part II: Applications of bilinear programming,” Technical Report 71-10, Dept. of OR, Stanford University (1971).

H. Konno, “A cutting plane algorithm for solving bilinear programs,”

*Mathematical Programming*11 (1976) 14–27.O.L. Mangasarian, “Equilibrium points of bimatrix games,”

*SIAM Journal*12 (1964) 778–780.O.L. Mangasarian and H. Stone, “Two person nonzero-sum games and quadratic programming,”

*Journal of Mathematical Analysis and Applications*9 (1964) 345–355.R.T. Rockafellar,

*Convex Analysis*(Princeton University Press, Princeton, NJ, 1970).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.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).

E.N. Sokirjanskaja, “Nekotorye algoritmy bilineinovo programmirovanija,”

*Kibernetika*4 (1974) 106–112.R.M. Soland, “Optimal facility location with concave costs,”

*Operations Research*22 (1974) 373–382.T.V. Thieu, “Relationship between bilinear programming and concave minimization under linear constraints,”

*Acta Mathematica Vietnamica*5 (1980) 106–113.T.V. Thieu, “Computer program for concave minimization over a polytope,” Preprint No. 18, Institute of Mathematics, Hanoi 1983.

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.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.H. Tuy, “Concave programming under linear constraints,”

*Doklady Akademiia Nauk USSR*159 (1964), 32–35. Translated in*Soviet Mathematics Doklady*5 (1964) 1437–1440.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).

H. Tuy, “On outer approximation methods for solving concave minimization problems,”

*Acta Mathematica Vietnamica*8 (1983) 3–34.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.H. Vaish and C.M. Shetty, “The bilinear programming problem,”

*Naval Research Logistics Quarterly*23 (1976) 303–309.H. Vaish and C.M. Shetty, “A cutting plane algorithm for the bilinear programming problem,”

*Naval Research Logistics Quarterly*24 (1977) 83–94.

## Author information

### Authors and Affiliations

## Rights and permissions

## About this article

### Cite this article

Thieu, T.V. A note on the solution of bilinear programming problems by reduction to concave minimization.
*Mathematical Programming* **41**, 249–260 (1988). https://doi.org/10.1007/BF01580766

Received:

Revised:

Issue Date:

DOI: https://doi.org/10.1007/BF01580766

### Key words

- Outer-approximation algorithm
- bilinear programming problem
- concave minimization problem