Abstract
Convex and concave envelopes play important roles in various types of optimization problems. In this article, we present a result that gives general guidelines for constructing convex and concave envelopes of functions of two variables on bounded quadrilaterals. We show how one can use this result to construct convex and concave envelopes of bilinear and fractional functions on rectangles, parallelograms and trapezoids. Applications of these results to global optimization are indicated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F.A. Al-Khayyal and J.E. Falk, “Jointly constrained biconvex programming,” Mathematics of Operations Research, vol. 8, pp. 273–286, 1983.
H.P. Benson, “Deterministic algorithms for constrained concave minimization: A unified critical survey,” Naval Research Logistics, vol. 43, pp. 765–795, 1996.
H.P. Benson, “On the construction and utilization of convex and concave envelopes of bilinear and fractional functions,” Department of Decision and Information Sciences, University of Florida, Working Paper, July 2001.
H.P. Benson, “Separable concave minimization via partial outer approximation and branch and bound,” Operations Research Letters, vol. 9, pp. 389–394, 1990.
H.P. Benson and S.S. Erenguc, “Using convex envelopes to solve the interactive fixed charge linear programming problem,” Journal of Optimization Theory and Applications, vol. 59, pp. 223–246, 1988.
J.E. Falk and R.M. Soland, “An algorithm for separable nonconvex programming problems,” Management Science, vol. 15, pp. 550–569, 1969.
G. Gallo and A. Ulkucu, “Bilinear programming: An exact algorithm,” Mathematical Programming, vol. 12, pp. 173–194, 1977.
R. Horst and H. Tuy, Global Optimization: Deterministic Approaches, 2nd edn., Springer-Verlag: Berlin, 1993.
B. Kalantari and J.B. Rosen, “An algorithm for global minimization of linearly constrained concave quadratic functions,” Mathematics of Operations Research, vol. 12, pp. 544–561, 1987.
T. Kuno, “A branch-and-bound algorithm for maximizing the sum of several linear ratios,” Journal of Global Optimization, vol. 22, pp. 155–174, 2002.
G.P. McCormick, “Computability of global solutions to factorable nonconvex programs: Part I-convex underestimating problems,” Mathematical Programming, vol. 10, pp. 147–175, 1976.
A.D. Rikun, “A convex envelope formula for multilinear functions,” Journal of Global Optimization, vol. 10, pp. 425–437, 1997.
J.B. Rosen and P. M. Pardalos, “Global minimization of large-scale constrained concave quadratic problems by separable programming,” Mathematical Programming, vol. 34, pp. 163–174, 1986.
H.S. Ryoo and N.V. Sahinidis, “Analysis of bounds for multilinear functions,” Journal of Global Optimization, vol. 19, pp. 403–424, 2001.
M. Tawarmalani and N. Sahinidis, “Semidefinite relaxations of fractional programs via novel convexification techniques,” Journal of Global Optimization, vol. 20, pp. 137–158, 2001.
H. Tuy, Convex Analysis and Global Optimization, Kluwer Academic Publishers: Norwell, MA, 1998.
J.M. Zamora and I.E. Grossmann, “A branch and contract algorithm for problems with concave, univariate, bilinear and linear fractional terms,” Journal of Global Optimization, vol. 14, pp. 217–249, 1999.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Benson, H.P. On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals. Computational Optimization and Applications 27, 5–22 (2004). https://doi.org/10.1023/B:COAP.0000004976.52180.7f
Issue Date:
DOI: https://doi.org/10.1023/B:COAP.0000004976.52180.7f