Abstract
In a recent work, we introduced the concept of convex extensions for lower semi-continuous functions and studied their properties. In this work, we present new techniques for constructing convex and concave envelopes of nonlinear functions using the theory of convex extensions. In particular, we develop the convex envelope and concave envelope of z=x/y over a hypercube. We show that the convex envelope is strictly tighter than previously known convex underestimators of x/y. We then propose a new relaxation technique for fractional programs which includes the derived envelopes. The resulting relaxation is shown to be a semidefinite program. Finally, we derive the convex envelope for a class of functions of the type f(x,y) over a hypercube under the assumption that f is concave in x and convex in y.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Al-Khayyal, F.A. and Falk, J.E. (1983), Jointly Constrained Biconvex Programming. Mathematics of Operations Research 8: 273-286.
Alizadeh, F. (1995), Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. SIAM Journal of Optimization 5: 13-51.
Barros, A.I. (1998), Discrete and Fractional Programming Technqiues for Location Models. Kluwer Academic Publishers, Dordrecht.
Bradley, S.P. and Frey, C.S. (1974), Fractional Programming with Homogenous Functions. Operations Research 22: 350-357.
Cambini, A., Castagnoli, E., Martein, L., Mazzoleni, P. and Schaible, S., (eds.) (1990), Generalized Convexity and Fractional Programming with Economic Applications, volume 345 of Lecture Notes in Economics and Mathematical Systems. Springer Verlag.
Falk, J.E. and Polocsay, S.W. (1994), Image Space Analysis of Generalized Fractional Programs. Journal of Global Optimization 4: 63-88.
Fujie, T. and Kojima, M. (1997), Semidefinite Programming Relaxation for Nonconvex Quadratic Programs. Journal of Global Optimization 10: 367-380.
Gill, P.E., Murray, W. and Saunders, M.A. (1999), User's Guide for SNOPT 5.3: A FORTRAN Package for Large-Scale Nonlinear Programming. Technical report, Technical Report, University of California, San Diego and Stanford University, CA.
Kojima, M. and Tunçel, L. (1999), Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. Technical report, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan.
Konno, H. and Kuno, T. (1990), Generalized Linear Multiplicative and Fractional Programming. Annals of Operations Research 25: 147-162.
Li, H. (1994), A Global Approach for General 0.1 Fractional Programming. European Journal of Operational Research 73: 590-596.
Lobo, M.S., Vandenberghe, L., Boyd, S. and Lebret, H. (1998), Applications of Second-Order Cone Programming. Linear Algebra Applications 284: 193-228.
Lovàsz, L. and Schrijver, A. (1991), Cones of Matrices and Set-functions and 0-1 Optimization.SIAM Journal on Optimization 1: 166-190.
Matsui, T. (1996), NP-Hardness of Linear Multiplicative Programming and Related Problems. Journal of Global Optimization 9: 113-119.
McCormick, G.P. (1976), Computability of Global Solutions to Factorable Nonconvex Programs: Part I-Convex Underestimating Problems. Mathematical Programming 10: 147-175.
McCormick, G.P. (1982), Nonlinear Programming: Theory, Algorithms and Applications. John Wiley and Sons.
Meister, B. and Oettli, W. (1967), On the Capacity of a Discrete, Constant Channel. Information and Control 11: 341-351.
Murtagh, B.A. and Saunders, M.A. (1995), MINOS 5.5 User's Guide. Technical report, Technical Report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University, CA.
Nesterov, Y. and Nemirovskii, A. (1994), Interior-Point Polynomial Algorithms in Convex Programming, volume 13. SIAM Studies in Applied Mathematics, Philadelphia.
Poljak, S., Rendl, F. and Wolkowicz, H. (1994), A Recipe for Semidefinite Relaxations of (0,1) Quadratic Programming. Technical report, University of Waterloo.
Quesada, I. and Grossmann, I.E. (1995), A Global Optimization Algorithm for Linear Fractional and Bilinear Programs. Journal of Global Optimization 6: 39-76.
Rikun, A.D. (1997), A Convex Envelope Formula for Multilinear Functions. Journal of Global Optimization 10: 425-437.
Rockafellar, R.T. (1970), Convex Analysis. Princeton Mathematical Series. Princeton University Press.
Schaible, S. (1995), Fractional programming with sums of ratios. In: E. Castagnoli and J. Giorgi (eds.), Proceedings of the Workshop held in Milan on March 28, 1995, pp. 163-175.
Schaible, S. (1996), Fractional Programming. In S.I. Gass and C.M. Harris (eds.), Encyclopedia of Operations Research and Management Science, Boston: Kluwer Academic Publishers, pp 234-237.
Sherali, H.D. (1997), Convex Envelopes of Multilinear Functions over a Unit Hypercube and over Special Discrete Sets. Acta Mathematica Vietnamica 22: 245-270.
Stancu-Minasian, I.M. (1990), On Some Fractional Programming Models Occurring in Minimum-Risk Problems. In Cambini et al. [5], pp. 295-324.
Stancu-Minasian, I.M. (1997), Fractional Programming. Netherlands: Kluwer Academic Publishers.
Tawarmalani, M., Ahmed, S. and Sahinidis, N.V. (1999), Global Optimization of 0.1 Hyperbolic Programs. Journal of Global Optimization. http://archimedes.scs.uiuc.edu/papers/fractional.pdf.
Tawarmalani, M. and Sahinidis, N.V. (1999), Global Optimization of Mixed Integer Nonlinear Programs: A Theoretical and Computational Study. Mathematical Programming. http://archimedes.scs.uiuc.edu/papers/comp.pdf.
Tawarmalani, M. and Sahinidis, N.V. (2000), Convex Extensions and Convex Envelopes of l.s.c. Functions. Mathematical Programming. http://archimedes.scs.uiuc.edu/papers/extensions.pdf.
Vandenberghe, L. and Boyd, S. (1996), Semidefinite Programming. SIAM Review 38: 49-95.
Yee, T.F. and Grossmann, I.E. (1990), Simultaneous Optimization Models for Heat Integration-II. Heat Exchanger Network Synthesis. Computers and Chemical Engineering 14: 1165-1184.
Zamora, J.M. and Grossmann, I.E. (1998), MINLP Model for Heat Exchanger Networks. Computers & Chemical Engineering 22: 367-384.
Zamora, J.M. and Grossmann, I.E. (1999), A Branch and Contract Algorithm for problems with Concave Univariate, Bilinear and Linear Fractional Terms. Journal of Global Optimization 14: 217-249.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tawarmalani, M., Sahinidis, N.V. Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques. Journal of Global Optimization 20, 133–154 (2001). https://doi.org/10.1023/A:1011233805045
Issue Date:
DOI: https://doi.org/10.1023/A:1011233805045