Skip to main content
Log in

GloMIQO: Global mixed-integer quadratic optimizer

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper introduces the global mixed-integer quadratic optimizer, GloMIQO, a numerical solver addressing mixed-integer quadratically-constrained quadratic programs to \({\varepsilon}\)-global optimality. The algorithmic components are presented for: reformulating user input, detecting special structure including convexity and edge-concavity, generating tight convex relaxations, partitioning the search space, bounding the variables, and finding good feasible solutions. To demonstrate the capacity of GloMIQO, we extensively tested its performance on a test suite of 399 problems of diverse size and structure. The test cases are taken from process networks applications, computational geometry problems, GLOBALLib, MINLPLib, and the Bonmin test set. We compare the performance of GloMIQO with respect to four state-of-the-art global optimization solvers: BARON 10.1.2, Couenne 0.4, LindoGLOBAL 6.1.1.588, and SCIP 2.1.0.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1–41 (2009). http://mpc.zib.de/index.php/MPC/article/view/4

  2. Achterberg T., Koch T., Martin A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42–54 (2005)

    Article  Google Scholar 

  3. Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: a new approach to integrate CP and MIP. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR (2008)

  4. Adams, W.P., Johnson, T.A.: Improved linear programming-based lower bounds for the quadratic assignment problem. In: Wolkowicz, H., Pardalos, P.M. (eds.) Quadratic Assignment and Related Problems: DIMACS Workshop. American Mathematical Society (1994)

  5. Adhya N., Tawarmalani M., Sahinidis N.V.: A Lagrangian approach to the pooling problem. Ind. Eng. Chem. Res. 38(5), 1965–1972 (1999)

    Article  Google Scholar 

  6. Adjiman C.S., Dallwig S., Floudas C.A., Neumaier A.: A global optimization method, αBB, for general twice differentiable NLPs-I. Theoretical advances. Comput. Chem. Eng. 22, 1137–1158 (1998)

    Article  Google Scholar 

  7. Adjiman C.S., Androulakis I.P., Floudas C.A.: A global optimization method, αBB, for general twice differentiable NLPs-II. Implementation computional results. Comput. Chem. Eng. 22, 1159–1179 (1998)

    Article  Google Scholar 

  8. Aggarwal A., Floudas C.A.: Synthesis of general distillation sequences—nonsharp separations. Comput. Chem. Eng. 14(6), 631–653 (1990)

    Article  Google Scholar 

  9. Ahmetovićs E., Grossmann I.E.: Global superstructure optimization for the design of integrated process water networks. AIChE J. 57(2), 434–457 (2011)

    Article  Google Scholar 

  10. Ahmetović, E., Grossmann, I.E.: Integrated process water networks design problem, 2010. Available from CyberInfrastructure for MINLP [ www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at: http://www.minlp.org/library/problem/index.php?i=101

  11. Al-Khayyal F.A., Falk J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273–286 (1983)

    Article  Google Scholar 

  12. Almutairi H., Elhedhli S.: A new Lagrangean approach to the pooling problem. J. Global Optim. 45, 237–257 (2009)

    Article  Google Scholar 

  13. Alva-Argáez A., Kokossis A.C., Smith R.: Wastewater minimisation of industrial systems using an integrated approach. Comput. Chem. Eng. 22, S741–S744 (1998)

    Article  Google Scholar 

  14. Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide. Society for Industrial and Applied Mathematics, 3rd edn (1999)

  15. Androulakis I.P., Maranas C.D., Floudas C.A.: αBB: a global optimization method for general constrained nonconvex problems. J. Global Optim. 7, 337–363 (1995)

    Article  Google Scholar 

  16. Anstreicher K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2–3), 471–484 (2009)

    Article  Google Scholar 

  17. Anstreicher K.M., Burer S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124(1–2), 33–43 (2010)

    Article  Google Scholar 

  18. Audet C., Hansen P., Jaumard B., Savard G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. 87(1), 131–152 (2000)

    Google Scholar 

  19. Audet C., Hansen P., Messine F., Xiong J.: The largest small octagon. J. Comb. Theory Ser. A 98(1), 46–59 (2002)

    Article  Google Scholar 

  20. Audet C., Brimberg J., Hansen P., Le Digabel S., Mladenovic N.: Pooling problem: alternate formulations and solution methods. Manage. Sci. 50(6), 761–776 (2004)

    Article  Google Scholar 

  21. Audet C., Hansen P., Messine F.: The small octagon with longest perimeter. J. Comb. Theory Ser. A 114(1), 135–150 (2007)

    Article  Google Scholar 

  22. Bagajewicz M.: A review of recent design procedures for water networks in refineries and process plants. Comput. Chem. Eng. 24, 2093–2113 (2000)

    Article  Google Scholar 

  23. Baliban R.C., Elia J.A., Floudas C.A.: Toward novel hybrid biomass, coal, and natural gas processes for satisfying current transportation fuel demands, 1: Process alternatives, gasification modeling, process simulation, and economic analysis. Ind. Eng. Chem. Res. 49(16), 7343–7370 (2010)

    Article  Google Scholar 

  24. Baliban R.C., Elia J.A., Floudas C.A.: Optimization framework for the simultaneous process synthesis, heat and power integration of a thermochemical hybrid biomass, coal, and natural gas facility. Comput. Chem. Eng. 35(9), 1647–1690 (2011)

    Article  Google Scholar 

  25. Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. doi:10.1007/s10107-011-0462-2

  26. Bao X., Sahinidis N.V., Tawarmalani M.: Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optim. Methods Softw. 24(4–5), 485–504 (2009)

    Article  Google Scholar 

  27. Belotti P., Lee J., Liberti L., Margot F., Wächter A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4–5), 597–634 (2009)

    Article  Google Scholar 

  28. Ben-Tal A., Eiger G., Gershovitz V.: Global minimization by reducing the duality gap. Math. Program. 63, 193–212 (1994)

    Article  Google Scholar 

  29. Bergamini M.L., Grossmann I., Scenna N., Aguirre P.: An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Comput. Chem. Eng. 32(3), 477–493 (2008)

    Article  Google Scholar 

  30. Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. Technical report 09-23, ZIB, Takustr.7, 14195 Berlin (2009)

  31. Berthold, T., Gleixner, A.M., Heinz, S., Vigerske, S.: On the computational impact of MIQCP solver components. Technical report 11-01, ZIB, Takustr.7, 14195 Berlin (2011)

  32. Bonami P., Biegler L.T., Conn A.R., Cornuéjols G., Grossmann I.E., Laird C.D., Lee J., Lodi A., Margot F., Sawaya N., Wächter A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2), 186–204 (2008)

    Article  Google Scholar 

  33. Brooke, A., Kendrick, D., Meeraus, A.: General algebraic modeling language (GAMS). http://www.gams.com/, 2009. Version 23.3.0

  34. Burer S., Letchford A.N.: On nonconvex quadratic programming with box constraints. SIAM J. Optim. 20(2), 1073–1089 (2009)

    Article  Google Scholar 

  35. Burer S., Vandenbussche D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2), 259–282 (2008)

    Article  Google Scholar 

  36. Bussieck M.R., Vigerske S.: MINLP solver software. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds) Wiley Encyclopedia of Operations Research and Management Science, Wiley, Chichester (2010)

    Google Scholar 

  37. Bussieck M.R., Drud A.S., Meeraus A.: MINLPLib—a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114–119 (2003)

    Article  Google Scholar 

  38. Cambini R., Sodini C.: Decomposition methods for solving nonconvex quadratic programs via branch and bound. J. Global Optim. 33, 313–336 (2005)

    Article  Google Scholar 

  39. Ciric A.R., Floudas C.A.: A retrofit approach for heat exchanger networks. Comput. Chem. Eng. 13(6), 703–715 (1989)

    Article  Google Scholar 

  40. Costa, A., Hansen, P., Liberti, L.: On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square. http://www.optimization-online.org/DB_HTML/2011/04/3013.html (2011)

  41. Dolan E.D., Moré J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002)

    Article  Google Scholar 

  42. Domes F.: GloptLab—a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems. Optim. Methods Softw. 24, 727–747 (2009)

    Article  Google Scholar 

  43. Domes F., Neumaier A.: A scaling algorithm for polynomial constraint satisfaction problems. J. Global Optim. 42, 327–345 (2008)

    Article  Google Scholar 

  44. Domes F., Neumaier A.: Constraint propagation on quadratic constraints. Constraints 15(3), 404–429 (2010)

    Article  Google Scholar 

  45. Domes F., Neumaier A.: Rigorous enclosures of ellipsoids and directed cholesky factorizations. SIAM J. Matrix Anal. Appl. 32, 262–285 (2011)

    Article  Google Scholar 

  46. Dorneich M.C., Sahinidis N.V.: Global optimization algorithms for chip layout and compaction. Eng. Optim. 25, 131–154 (1995)

    Article  Google Scholar 

  47. Duran M.A., Grossmann I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307–339 (1986)

    Article  Google Scholar 

  48. Duran M.A., Grossmann I.E.: A mixed-integer nonlinear programming algorithm for process systems synthesis. AIChE J. 32(4), 592–606 (1986)

    Article  Google Scholar 

  49. Elia J.A., Baliban R.C., Floudas C.A.: Toward novel hybrid biomass, coal, and natural gas processes for satisfying current transportation fuel demands, 2: simultaneous heat and power integration. Ind. Eng. Chem. Res. 49(16), 7371–7388 (2010)

    Article  Google Scholar 

  50. Faria D.C., Bagajewicz M.J.: On the appropriate modeling of process plant water systems. AIChE J. 56(3), 668–689 (2010)

    Google Scholar 

  51. Floudas C.A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, New York (1995)

    Google Scholar 

  52. Floudas C.A.: Deterministic Global Optimization : Theory, Methods and Applications. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  53. Floudas C.A., Aggarwal A.: A decomposition strategy for global optimum search in the pooling problem. ORSA J. Comput. 2, 225–235 (1990)

    Article  Google Scholar 

  54. Floudas C.A., Anastasiadis S.H.: Synthesis of distillation sequences with several multicomponent feed and product streams. Chem. Eng. Sci. 43(9), 2407–2419 (1988)

    Article  Google Scholar 

  55. Floudas C.A., Gounaris C.E.: A review of recent advances in global optimization. J. Global Optim. 45(1), 3–38 (2009)

    Article  Google Scholar 

  56. Floudas C.A., Grossmann I.E.: Synthesis of flexible heat-exchanger networks with uncertain flowrates and temperatures. Comput. Chem. Eng. 11(4), 319–336 (1987)

    Article  Google Scholar 

  57. Floudas C.A., Pardalos P.M.: State-of-the-art in global optimization—computational methods and applications—preface. J. Global Optim. 7(2), 113 (1995)

    Article  Google Scholar 

  58. Floudas C.A., Paules G.E.: A mixed-integer nonlinear programming formulation for the synthesis of heat-integrated distillation sequences. Comput. Chem. Eng. 12(6), 531–546 (1988)

    Article  Google Scholar 

  59. Floudas C.A., Pardalos P.M., Adjiman C.S., Esposito W.R., Gms Z.H., Harding S.T., Klepeis J.L., Meyer C.A., Schweiger C.A.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Dordrecht (1999)

    Book  Google Scholar 

  60. Floudas C.A., Akrotirianakis I.G., Caratzoulas S., Meyer C.A., Kallrath J.: Global optimization in the 21st century: advances and challenges. Comput. Chem. Eng. 29, 1185–1202 (2005)

    Article  Google Scholar 

  61. Foulds L.R., Haughland D., Jornsten K.: A bilinear approach to the pooling problem. Optimization 24, 165–180 (1992)

    Article  Google Scholar 

  62. Galan B., Grossmann I.E.: Optimal design of distributed wastewater treatment networks. Ind. Eng. Chem. Res. 37(10), 4036–4048 (1998)

    Article  Google Scholar 

  63. Gau C.Y., Schrage L.E.: Implementation and testing of a branch-and-bound based method for deterministic global optimization: operations research applications. In: Floudas, C.A., Pardalos, P.M. (eds) Frontiers in Global Optimization, pp. 145–164. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  64. Gill, P.E., Murray, W., Saunders, M.A.: SNOPT. http://www.sbsi-sol-optimize.com/asp/sol_product_snopt.htm. (1999) Version 5.3

  65. Gounaris C.E., Misener R., Floudas C.A.: Computational comparison of piecewise-linear relaxations for pooling problems. Ind. Eng. Chem. Res. 48(12), 5742–5766 (2009)

    Article  Google Scholar 

  66. Hasan M.M.F., Karimi I.A.: Piecewise linear relaxation of bilinear programs using bivariate partitioning. AIChE J. 56(7), 1880–1893 (2010)

    Article  Google Scholar 

  67. Haverly C.A.: Studies of the behavior of recursion for the pooling problem. ACM SIGMAP Bull. 25, 19–28 (1978)

    Article  Google Scholar 

  68. Horst, R., Hoang, T.: Global optimization: deterministic approaches. Springer (1996). ISBN 9783540610380

  69. ILOG. CPLEX. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/, 2011. Version 12.2

  70. Janak S.L., Floudas C.A.: Improving unit-specific event based continuous-time approaches for batch processes: Integrality gap and task splitting. Comput. Chem. Eng. 32(4–5), 913–955 (2008)

    Article  Google Scholar 

  71. Jeżowski J.: Review of water network design methods with literature annotations. Ind. Eng. Chem. Res. 49(10), 4475–4516 (2010)

    Article  Google Scholar 

  72. Kallrath J.: Cutting circles and polygons from area-minimizing rectangles. J. Global Optim. 43, 299–328 (2009)

    Article  Google Scholar 

  73. Karuppiah R., Grossmann I.E.: Global optimization for the synthesis of integrated water systems in chemical processes. Comput. Chem. Eng. 30, 650–673 (2006)

    Article  Google Scholar 

  74. Klepeis J.L., Floudas C.A., Morikis D., Tsokos C.G., Lambris J.D.: Design of peptide analogues with improved activity using a novel de novo protein design approach. Ind. Eng. Chem. Res. 43(14), 3817–3826 (2004)

    Article  Google Scholar 

  75. Kokossis A.C., Floudas C.A.: Synthesis of isothermal reactor–separator–recycle systems. Chem. Eng. Sci. 46(5–6), 1361–1383 (1991)

    Google Scholar 

  76. Kokossis A.C., Floudas C.A.: Optimization of complex reactor networks—II. Nonisothermal operation. Chem. Eng. Sci. 49(7), 1037–1051 (1994)

    Article  Google Scholar 

  77. Lebbah Y., Michel C., Rueher M.: A rigorous global filtering algorithm for quadratic constraints. Constraints 10(1), 47–65 (2005)

    Article  Google Scholar 

  78. Lee H., Pinto J.M., Grossmann I.E., Park S.: Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management. Ind. Eng. Chem. Res. 35(5), 1630–1641 (1996)

    Article  Google Scholar 

  79. Lee S., Grossmann I.E.: Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks. Comput. Chem. Eng. 27(11), 1557–1575 (2003)

    Article  Google Scholar 

  80. Li J., Li A., Karimi I.A., Srinivasan R.: Improving the robustness and efficiency of crude scheduling algorithms. AIChE J. 53(10), 2659–2680 (2007)

    Article  Google Scholar 

  81. Li J., Misener R., Floudas C.A.: Continuous-time modeling and global optimization approach for scheduling of crude oil operations. AIChE J. 58(1), 205–226 (2012)

    Article  Google Scholar 

  82. Li, X., Tomasgard, A., Barton, P.I.: Decomposition strategy for the stochastic pooling problem. J. Global Optim. doi:10.1007/s10898-011-9792-0

  83. Li X., Armagan E., Tomasgard A., Barton P.I.: Stochastic pooling problem for natural gas production network design and operation under uncertainty. AIChE J. 57(8), 2120–2135 (2011)

    Article  Google Scholar 

  84. Liberti L.: Reduction constraints for the global optimization of NLPs. Int. Trans. Oper. Res. 11, 33–41 (2004)

    Article  Google Scholar 

  85. Liberti L., Pantelides C.C.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J. Global Optim. 36(2), 161–189 (2006)

    Article  Google Scholar 

  86. Lin X., Floudas C.A.: Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation. Comput. Chem. Eng. 25(4–6), 665–674 (2001)

    Article  Google Scholar 

  87. Lin Y., Schrage L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4–5), 657–668 (2009)

    Article  Google Scholar 

  88. Lougee-Heimer R.: The common optimization interface for operations research: promoting open-source software in the operations research community. IBM J. Res. Dev. 47(1), 57–66 (2003)

    Article  Google Scholar 

  89. Maranas C.D., Floudas C.A.: Finding all solutions of nonlinearly constrained systems of equations. J. Global Optim. 7(2), 143–182 (1995)

    Article  Google Scholar 

  90. Maranas C.D., Androulakis I.P., Floudas C.A., Berger A.J., Mulvey J.M.: Solving long-term financial planning problems via global optimization. J. Econ. Dyn. Control 21(8–9), 1405–1425 (1997)

    Article  Google Scholar 

  91. McCormick G.P.: Computability of global solutions to factorable nonconvex programs: part 1-convex underestimating problems. Math. Program. 10(1), 147–175 (1976)

    Article  Google Scholar 

  92. Meeraus, A.: GLOBALLib. http://www.gamsworld.org/global/globallib.htm

  93. Meyer C.A., Floudas C.A.: Global optimization of a combinatorially complex generalized pooling problem. AIChE J. 52(3), 1027–1037 (2006)

    Article  Google Scholar 

  94. Meyer C.A., Floudas C.A.: Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. In: Floudas, C.A., Pardalos, P.M. (eds) Frontiers in Global Optimization, pp. 327–352. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  95. Meyer C.A., Floudas C.A.: Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. J. Global Optim. 29(2), 125–155 (2004)

    Article  Google Scholar 

  96. Meyer C.A., Floudas C.A.: Convex envelopes for edge-concave functions. Math. Program. 103(2), 207–224 (2005)

    Article  Google Scholar 

  97. Misener R., Floudas C.A.: Advances for the pooling problem: modeling, global optimization, and computational studies. Appl. Comput. Math. 8(1), 3–22 (2009)

    Google Scholar 

  98. Misener R., Floudas C.A.: Global optimization of large-scale pooling problems: quadratically constrained MINLP models. Ind. Eng. Chem. Res. 49(11), 5424–5438 (2010)

    Article  Google Scholar 

  99. Misener, R., Floudas, C.A.: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Math. Program. B. (accepted for publication) http://www.optimization-online.org/DB_HTML/2011/11/3240.html

  100. Misener R., Gounaris C.E., Floudas C.A.: Mathematical modeling and global optimization of large-scale extended pooling problems with the (EPA) complex emissions constraints. Comput. Chem. Eng. 34(9), 1432–1456 (2010)

    Article  Google Scholar 

  101. Misener R., Thompson J.P., Floudas C.A.: APOGEE: global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes. Comput. Chem. Eng. 35(5), 876–892 (2011)

    Article  Google Scholar 

  102. Mouret, S., Grossmann, I.E.: Crude-oil operations scheduling. Available from CyberInfrastructure for MINLP [ www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at: http://www.minlp.org/library/problem/index.php?i=117 (2010)

  103. Mouret S., Grossmann I.E., Pestiaux P.: A novel priority-slot based continuous-time formulation for crude-oil scheduling problems. Ind. Eng. Chem. Res. 48(18), 8515–8528 (2009)

    Article  Google Scholar 

  104. Mouret S., Grossmann I.E., Pestiaux P.: A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling. Comput. Chem. Eng. 35(12), 2750–2766 (2011)

    Article  Google Scholar 

  105. Nowak, I.: Relaxation and decomposition methods for mixed integer nonlinear programming. International Series of Numerical Mathematics. Birkhäuser (2005) ISBN 9783764372385

  106. Pardalos P.M.: Global optimization algorithms for linearly constrained indefinite quadratic problems. Comput. Math. Appl. 21(6–7), 87–97 (1991)

    Article  Google Scholar 

  107. Pham V., Laird C., El-Halwagi M.: Convex hull discretization approach to the global optimization of pooling problems. Ind. Eng. Chem. Res. 48, 1973–1979 (2009)

    Article  Google Scholar 

  108. Ponce-Ortega J.M., El-Halwagi M.M., Jiménez-Gutiérrez A.: Global optimization for the synthesis of property-based recycle and reuse networks including environmental constraints. Comput. Chem. Eng. 34(3), 318–330 (2010)

    Article  Google Scholar 

  109. Quesada I., Grossmann I.E.: Global optimization of bilinear process networks with multicomponent flows. Comput. Chem. Eng. 19, 1219–1242 (1995)

    Article  Google Scholar 

  110. Rebennack S., Kallrath J., Pardalos P.M.: Column enumeration based decomposition techniques for a class of non-convex MINLP problems. J. Global Optim. 43(2–3), 277–297 (2009)

    Article  Google Scholar 

  111. Rikun A.D.: A convex envelope formula for multilinear functions. J. Global Optim. 10, 425–437 (1997)

    Article  Google Scholar 

  112. Rios L., Sahinidis N.V.: Portfolio optimization for wealth-dependent risk preferences. Ann. Oper. Res. 177, 63–90 (2010)

    Article  Google Scholar 

  113. Rosen J.B., Pardalos P.M.: Global minimization of large-scale constrained concave quadratic problems by separable programming. Math. Program. 34(2), 163–174 (1986)

    Article  Google Scholar 

  114. Ruiz, J.P., Grossmann, I.E.: Water treatment network design. Available from CyberInfrastructure for MINLP [www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at: http://www.minlp.org/library/problem/index.php?i=24 (2009)

  115. Ruiz J.P., Grossmann I.E.: Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks. Optim. Lett. 5, 1–11 (2011)

    Article  Google Scholar 

  116. Ruiz J.P., Grossmann I.E.: Using redundancy to strengthen the relaxation for the global optimization of MINLP problems. Comput. Chem. Eng. 35, 2729–2740 (2011)

    Article  Google Scholar 

  117. Ryoo H.S., Sahinidis N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551–566 (1995)

    Google Scholar 

  118. Ryoo H.S., Sahinidis N.V.: A branch-and-reduce approach to global optimization. J. Global Optim. 8, 107–138 (1996)

    Article  Google Scholar 

  119. Saif Y., Elkamel A., Pritzker M.: Global optimization of reverse osmosis network for wastewater treatment and minimization. Ind. Eng. Chem. Res. 47(9), 3060–3070 (2008)

    Article  Google Scholar 

  120. Sawaya, N.W.: Reformulations, relaxations and cutting planes for generalized disjunctive programming. PhD in chemical engineering, Carnegie Mellon University (2006)

  121. Saxena A., Bonami P., Lee J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1–2), 383–411 (2010)

    Article  Google Scholar 

  122. Saxena A., Bonami P., Lee J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130, 359–413 (2011)

    Article  Google Scholar 

  123. Selot A., Kuok L.K., Robinson M., Mason T.L., Barton P.I.: A short-term operational planning model for natural gas production systems. AIChE J. 54(2), 495–515 (2008)

    Article  Google Scholar 

  124. Sherali, H., Dalkiran, E., Liberti, L.: Reduced RLT representations for nonconvex polynomial programming problems. J. Global Optim. doi:10.1007/s10898-011-9757-3

  125. Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (1999)

    Book  Google Scholar 

  126. Sherali H.D., Alameddine A.: A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. 2, 379–410 (1992)

    Article  Google Scholar 

  127. Sherali H.D., Tuncbilek C.H.: A reformulation-convexification approach for solving nonconvex quadratic-programming problems. J. Global Optim. 1(7), 1–31 (1995)

    Article  Google Scholar 

  128. Sherali H.D., Tuncbilek C.H.: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21(1), 1–9 (1997)

    Article  Google Scholar 

  129. Smith E.M.B., Pantelides C.C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex minlps. Comput. Chem. Eng. 23(4–5), 457–478 (1999)

    Article  Google Scholar 

  130. Tardella, F.: On a class of functions attaining their maximum at the vertices of a polyhedron. Discret. Appl. Math. 22, 191–195 (1988/1989)

    Google Scholar 

  131. Tardella F.: On the existence of polyhedral convex envelopes. In: Floudas, C.A., Pardalos, P.M. (eds) Frontiers in Global Optimization, pp. 563–573. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  132. Tardella F.: Existence and sum decomposition of vertex polyhedral convex envelopes. Optim. Lett. 2, 363–375 (2008)

    Article  Google Scholar 

  133. Tawarmalani M., Sahinidis N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Applications, Software, and Applications, Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Norwell (2002)

    Google Scholar 

  134. Tawarmalani M., Sahinidis N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563–591 (2004)

    Article  Google Scholar 

  135. Tawarmalani M., Sahinidis N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225–249 (2005)

    Article  Google Scholar 

  136. Vigerske, S.: COIN-OR/GAMSLinks. https://projects.coin-or.org/GAMSlinks/, 2011. Trunk Revision 1026

  137. Visweswaran, V.: MINLP: applications in blending and pooling. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, 2nd edn, pp. 2114–2121. Springer Science, Dordrecht (2009)

  138. Wächter A., Biegler L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25–57 (2006)

    Article  Google Scholar 

  139. Wicaksono D.S., Karimi I.A.: Piecewise MILP under-and overestimators for global optimization of bilinear programs. AIChE J. 54(4), 991–1008 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christodoulos A. Floudas.

Additional information

The authors thankfully acknowledge support from the National Science Foundation (CBET-0827907). R.M. is further grateful for her NSF Graduate Research Fellowship (DGE-0646086).

Electronic Supplementary Material

The Below is the Electronic Supplementary Material.

ESM 1 (PDF 128 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Misener, R., Floudas, C.A. GloMIQO: Global mixed-integer quadratic optimizer. J Glob Optim 57, 3–50 (2013). https://doi.org/10.1007/s10898-012-9874-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-012-9874-7

Keywords

Navigation