Abstract
We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem from the oil industry, and apply the algorithm to standard problems from the literature. Second, we apply the algorithm to fractional programming problems, which arise in finance. Finally, we show how it can be used to find the largest small octagon, a problem from geometry.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adhya N., Sahinidis N.V. and Tawarmalani M. (1999), “A Lagrangian Approach to the Pooling Problem”, Industrial & Engineering Chemistry Research 38, 1956–1972.
Al-Khayyal F.A. (1990), “Jointly Constrained Bilinear Programs and Related Problems: An Overview”, Computers & Mathematics with Applications 19, 53–62.
Al-Khayyal F.A. (1992), “Generalized Bilinear Programming, Part I: Models, Applications and Linear Programming Relaxation”, European Journal of Operational Research 60, 306–314.
Al-Khayyal F.A. and Falk J.E. (1983), “Jointly Constrained Biconvex Programming”, Mathematics of Operations Research 8, 273–286.
Al-Khayyal F.A., Larsen C. and Van Voorhis T. (1995), “A Relaxation Method for Nonconvex Quadratically Constrained Quadratic Programs”, Journal of Global Optimization 6, 215–230.
Audet C. (1997), “Optimisation globale structurée: propriétés, équivalences et résolution”, Thèse de Doctorat, École Polytechnique de Montréal, Canada. Thesis may be found at http://www.gerad.ca/Charles.Audet/.com.
Audet C., Brimberg J., Hansen P., Le Digabel S., Mladenovié N. (2000), “Pooling Problem: Alternate Formulations and Solution Methods”, Les Cahiers du GERAD G-2000–23, Montréal. To appear in Management Science.
Audet C., Carrizosa E., Hansen P. (2000), “An Exact Method for Fractional Goal Programming”, Les Cahiers du GERAD G-2000–64, Montréal.
Audet C., Hansen P., Jaumard, B., Savard, G. (2000), “A branch and cut algorithm for nonconvex quadratically constrained quadratic programming”, Mathematical Programming A87, 131–152.
Audet C., Hansen P., Messine F. and Xiong J. (2002), “The largest small octagon”, Journal of Combinatorial Theory, Series A 98 46–59.
Baker T.E. and Lasdon L.S. (1985), “Successive Linear Programming at Exxon”, Management Science 31 (3), 264–274.
Ben-Tal A., Eiger G. and Gershovitz V. (1994), “Global Minimization by Reducing the Duality Gap”, Mathematical Programming 63:193–212.
Brimberg J., Hansen P., Mladenovic N. (2000), “A Note on Reduction of Quadratic and Bilinear Programs with Equality Constraints”, Journal of Global Optimization 22,39–47.
Charnes A. and Cooper W.W. (1962), “Programming with linear fractional function-als”, Naval Research Logistics Quarterly 9, 181–186.
Chen D.Z., Daescu O., Dai Y., Katoh N. and Xiaodong W. (2000), “Optimizing the sum of linear fractional functions and applications”, Proc. of the 11th ACM/SIAM Symposium on Discrete Algorithms 707–716.
Chung S.J. (1989), “NP-Completeness of the Linear Complementarity Problem”, Journal of Optimization Theory and Applications 60, 393–399.
Dür M., Horst R. and Thoai N.V. (2001), “Solving Sum-of-Ratios Fractional Programs Using Efficient Points”, Optimization 49, 447–466.
Falk J.E. and Palocsay S.W. (1992), “Optimizing the Sum of Linear Fractional Functions”, in “Recent Advances in Global Optimization”, Edited by Floudas C.A. and Pardalos P.M., Princeton University Press, Princeton, 221–258.
Falk J.E. and Palocsay S.W. (1994), “Image space analysis of generalized fractional programs”, Journal of Global Optimization 4, 63–88.
Floudas C.A. (2000), “Deterministic Global Optimization. Theory, Methods and Applications”, Kluwer Academics Publishers, Dordrecht.
Floudas C.A. and Visweswaran V. (1993), “New Properties and Computational Improvement of the GOP Algorithm For Problems With Quadratic Objective Function and Constraints”, Journal of Global optimization 3, 439–462.
Floudas C.A. and Visweswaran V. (1995), “Quadratic Optimization”, Handbook of Global Optimization 217–269. Edited by Horst, R. and Pardalos P.M., Kluwer Academics Publishers, Dordrecht.
Floudas C.A. and Visweswaran V. (1996), “New Formulations and Branching Strategies for the GOP Algorithm”, in I.E. Grossmann (ed.) Global Optimization in Engineering Design, Kluwer Academics Publishers, Dordrecht.
Foulds L.R, Haugland D. and Jörnsten K. (1992), “A Bilinear Approach to the Pooling Problem”, Optimization 24, 165–180.
Glover F. and Laguna M. (1997), “Tabu Search”, Kluwer Academic, Publishers, Boston.
Graham R.L. (1975), “The Largest Small Hexagon”, Journal of Combinatorial Theory, Series A 18, 165–170.
Hansen P. and Jaumard B. (1992), “Reduction of Indefinite Quadratic Programs to Bilinear Programs”, Journal of Global optimization 2, 41–60.
Hansen P., Jaumard B. and Savard G. (1992), “New Branch-and-Bound Rules for Linear Bilevel Programming”, SIAM Journal on Scientific and Statistical Computing 13, 1194–1217.
Hansen P. and MladenoviĆ N. (2001), “Variable Neighborhood Search: Principles and Applications”, European Journal of Operational Research 130, 449–467.
Haverly C.A. (1978), “Studies of the Behaviour of Recursion for the Pooling Problem”, ACM SIGMAP Bulletin 25, 19–28.
Horst R., Pardalos P.M. (1995), “Handbook of Global Optimization”, Kluwer Academics Publishers, Dordrecht.
Horst R., Pardalos P.M. and Thoai N.V. (1995), “Introduction to Global Optimization”, Kluwer Academics Publishers, Dordrecht.
Horst R. and Thoai N.V. (1996), “A New Algorithm for Solving the General Quadratic Programming Problem”, Computational Optimization and Applications 5, 39–48.
Horst R. and Tuy H. (1996), “Global Optimization: Deterministic Approaches”, 3rd edition, Springer, Berlin.
Kojima M. and Tuncel L. (2000), “Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization”, Mathematical Programming 89, 79–111.
Konno H. and Abe N. (1999), “Minimization of the sum of three linear fractional functions”, Journal of Global Optimization 15, 419–432.
Konno H. and Fukaishi K. (2000), “A Branch-and-Bound Algorithm for Solving Low-Rank Linear Multiplicative and Fractional Programming Problem”, Journal of Global Optimization 18, 283–299.
Konno H., Thach P.T. and Thy H. (1997), “Optimization on Low Rank Nonconvex Structures”, Kluwer Academics Publishers, Dordrecht.
Konno H., Yajima Y. and Matsui T. (1991), “Parametric simplex algorithms for solving a special class of nonconvex minimization problems”, Journal of Global Optimization 1, 65–80.
Konno H. and Yamashita H. (1999), “Minimization of the sum and the product of several linear fractional functions”, Naval Research Logistics 46, 583–596.
Kornbluth J.S.H. (1973), “A survey of programming”, Omega 1, 193–205.
Kornbluth J.S.H. (1986), “On the use of multiple objective linear programming algorithms to solve problems with fractional objectives”, European Journal of Operational Research 23 78–81.
Kornbluth J.S.H. and Steuer E.R. (1981), “Goal programming with linear fractional criteria”, European Journal of Operational Research 8, 58–65.
Kuno T. (2002), “A branch-and-bound algorithm for maximizing the sum of several linear ratios”, Journal of Global Optimization 22, 155–174.
Matsui T. (1996), “NP-hardness of Linear Multiplicative Programming and Related Problems”, Journal of Global Optimization 9, 113–119.
Mladenovic N. and Hansen P. (1997), “Variable Neighborhood Search”, Computers and Operations Research 24, 1097–1100.
Raber U. (1998), “A Simplicial Branch-And-Bound Method for Solving Nonconvex All-Quadratic Programs”, Journal of Global Optimization 13, 417–432.
Reinhardt K. (1922), “Extremale Polygone gegebenen Durchmessers”, Jber Dtsch. Math. - Ver. 31, 251–270.
Romero C. (1991), “Hidden nonlinearities in linear goal programming models”, Handbook of Critical Issues of Goal Programming Pergamon, Oxford.
Ryoo H.S. and Sahinidis N.V. (1995), “Global Optimization of Nonconvex NLPs and MINLPs with Applications in process design”, Computers & Chemical Engineering 19, 551–566.
Schaible S. (1977), “A note on the sum of a linear and linear-fractional function”, Naval Research Logistics Quarterly 24, 691–693.
Schaible S. (1995), “Fractional Programming”, Handbook of Global Optimization 495–608. Edited by Horst, R. and Pardalos P.M., Kluwer Academics Publishers, Dordrecht.
Sherali H.D. and Alameddine A. (1990), “An Explicit Characterization of the Convex Envelope of a Bivariate Bilinear Function over Special Polytopes”, Annals of Operations Research 25, 197–210.
Sherali H.D. and Alameddine A. (1992), “A New Reformulation-Linearization Technique for Bilinear Programming Problems”, Journal of Global Optimization 2, 379–410.
Sherali H.D. and Tuncbilek C.H. (1992), “A Global Optimization Algorithm for Polynomial Programming Using a Reformulation-Linearization Technique”, Journal of Global Optimization 2, 101–112.
Sherali H.D. and Tuncbilek C.H. (1995), “A Reformulation-Convexification Approach for Solving Nonconvex Quadratic Programming Problems”, Journal of Global Optimization 7, 1–31.
Sherali H.D. and Tuncbilek C.H. (1997), “Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems”, Journal of Global Optimization 10, 381–390.
Sherali H.D. and Tuncbilek C.H. (1997), “New Reformulation Linearization / Convexification Relaxations for Univariate and Multivariate Polynomial Programming Problems”, Operations Research Letters 21, 1–9.
Tamiz M., Jones D.J. and Romero C. (1998), “Goal programming for decision making: An overview of the current state-of-the-art”, European Journal of Operational Research 111, 569–581.
Tawarmalani M. and Sahinidis N.V. (2001), “Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques”, Journal of Global Optimization 20, 137–158.
Thoai N.V. (2000), “Duality bound method for the general quadratic programming problem with quadratic constraints”, Journal of Optimization Theory and Applications 107, 331–354.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this paper
Cite this paper
Audet, C., Hansen, P., Le Digabel, S. (2004). Exact solution of three nonconvex quadratic programming problems. In: Floudas, C.A., Pardalos, P. (eds) Frontiers in Global Optimization. Nonconvex Optimization and Its Applications, vol 74. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0251-3_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0251-3_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7961-4
Online ISBN: 978-1-4613-0251-3
eBook Packages: Springer Book Archive