An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs

References

• Abhishek K, Leyffer S, Linderoth J (2010) FilMINT: An outer approximation-based solver for convex mixed-integer nonlinear programs. INFORMS J. Comput. 22(4):555–567.Link, Google Scholar
• Ben Ameur W, Ouorou A (2006) Mathematical models of the delay constrained routing problem. Algorithmic Oper. Res. 1(2):94–103.Google Scholar
• Bonami P, Kılınç M, Linderoth J (2012) Algorithms and software for convex mixed integer nonlinear programs. Lee J, Leyffer S, eds. Mixed Integer Nonlinear Programming, The IMA Volumes in Mathematics and Its Applications, Vol. 154 (Springer, New York), 1–39.Crossref, Google Scholar
• Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee Jet al. (2008) An algorithmic framework for convex mixed-integer nonlinear programs. Discrete Optim. 5(2):186–204.Crossref, Google Scholar
• Castillo I, Westerlund J, Emet S, Westerlund T (2005) Optimization of block layout deisgn problems with unequal areas: A comparison of MILP and MINLP optimization methods. Comput. Chemical Engrg. 30(1):54–69.Crossref, Google Scholar
• Duran MA, Grossmann I (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programming 36(3):307–339.Crossref, Google Scholar
• Elhedhli S (2006) Service system design with immobile servers, stochastic demand, and congestion. Manufacturing Service Oper. Management 8:92–97.Link, Google Scholar
• Fletcher R, Leyffer S (1994) Solving mixed-integer nonlinear programs by outer approximation. Math. Programming 66:327–349.Crossref, Google Scholar
• Fourer R, Gay DM, Kernighan BW (1993) AMPL: A Modeling Language for Mathematical Programming (Duxbury Press, Pacific Grove, CA).Google Scholar
• Frangioni A, Gentile C (2006) Perspective cuts for a class of convex 0-1 mixed-integer programs. Math. Programming 106:225–236.Crossref, Google Scholar
• Grossmann I, Viswanathan J, Vecchietti A, Raman R, Kalvelagen E (2001) GAMS/DICOPT: A discrete continuous optimization package. Math. Methods Appl. Sci. 11:649–664.Google Scholar
• Günlük O, Linderoth J (2010) Perspective relaxation of mixed-integer nonlinear programs with indicator variables. Math. Programming 124:183–205.Crossref, Google Scholar
• Günlük O, Lee J, Weismantel R (2007) MINLP strengthening for separable convex quadratic transportation-cost UFL. Technical Report RC24213 (W0703-042), IBM Research Division, T.J. Watson Research Center, Cambridge, MA.Google Scholar
• Harjunkoski I, Pörn R, Westerlund T (2009) MINLP: Trim-loss problem. Floudas CA, Pardalos PM, eds. Encyclopedia of Optimization (Springer, New York), 2190–2198.Crossref, Google Scholar
• Hijazi H (2010) Mixed-integer nonlinear optimization approaches for network design in telecommunications. Ph.D. thesis, Aix-Marseille Université, Marseille, France.Google Scholar
• Hijazi H, Bonami P, Cornuéjols G, Ouorou A (2012) Mixed-integer nonlinear programs featuring on/off constraints. Comput. Optim. Appl. 52:537–558.Crossref, Google Scholar
• Lougee-Heimer R (2003) The common optimization interface for operations research. IBM J. Res. Development 47:57–66.Crossref, Google Scholar
• Quesada I, Grossmann IE (1992) An LP/NLP based branch–and–bound algorithm for convex MINLP optimization problems. Comput. Chemical Engrg. 16(10–11):937–947.Crossref, Google Scholar
• Ravemark DE, Rippin DWT (1998) Optimal design of a multi-product batch plant. Comput. Chemical Engrg. 22(1–2):177–183.Crossref, Google Scholar
• Sawaya N (2006) Reformulations, relaxations and cutting planes for generalized disjunctive programming. Ph.D. thesis, Chemical Engineering Department, Carnegie Mellon University, Pittsburgh, PA.Google Scholar
• Sawaya N, Laird CD, Biegler LT, Bonami P, Conn AR, Cornuéjols G, Grossmann IEet al. (2006) CMU-IBM open source MINLP project test set. Accessed December 2011, http://egon.cheme.cmu.edu/ibm/page.htm.Google Scholar
• Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math. Programming 103(2):225–249.Crossref, Google Scholar
• Türkay M, Grossmann IE (1996) Logic-based MINLP algorithms for the optimal synthesis of process networks. Comput. Chemical Engrg. 20(8):959–978.Crossref, Google Scholar
• Vecchietti A, Grossmann IE (1999) LOGMIP: A disjunctive 0-1 non-linear optimizer for process system models. Comput. Chemical Engrg. 23(4–5):555–565.Crossref, Google Scholar
• Wächter A, Biegler LT (2006) On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Programming 106(1):25–57.Crossref, Google Scholar