An algorithmic framework for convex mixed integer nonlinear programs

Achterberg, 2005, Branching rules revisited, Operations Research Letters, 3, 42, 10.1016/j.orl.2004.04.002 Balas, 1993, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Mathematical Programming, 58, 295, 10.1007/BF01581273 Benichou, 1971, Experiments in mixed-integer programming, Mathematical Programming, 1, 76, 10.1007/BF01584074 R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, MIPLIB 3.0. http://www.caam.rice.edu/~bixby/miplib/miplib.html Bonmin (Basic Open-source Mixed INteger programming). http://projects.coin-or.org/Bonmin Castillo, 2005, Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methods, Computers & Chemical Engineering, 30, 54, 10.1016/j.compchemeng.2005.07.012 COIN-OR. www.coin-or.org Dicopt. http://www.gams.com/solvers/dicopt/main.htm Dolan, 2002, Benchmarking optimization software with performance profiles, Mathematical Programming, 91, 201, 10.1007/s101070100263 Duran, 1986, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Mathematical Programming, 36, 307, 10.1007/BF02592064 Fletcher, 1994, Solving mixed integer nonlinear programs by outer approximation, Mathematical Programming, 66, 327, 10.1007/BF01581153 R. Fletcher, S. Leyffer, User manual for FilterSQP. Numerical Analysis Report NA/181, Dundee University, 1998 Geoffrion, 1972, Generalized Benders decomposition, Journal of Optimization Theory and Applications, 10, 237, 10.1007/BF00934810 Grossmann, 2002, Review of nonlinear mixed-integer and disjunctive programming techniques, Optimization and Engineering, 3, 227, 10.1023/A:1021039126272 Grossmann, 2003, Generalized disjunctive programming: Nonlinear convex hull relaxation and algorithms, Computational Optimization and Applications, 26, 83, 10.1023/A:1025154322278 Gupta, 1985, Branch and bound experiments in convex nonlinear integer programming, Management Science, 31, 1533, 10.1287/mnsc.31.12.1533 Harjunkoski, 1998, Different transformations for solving non-convex trim loss problems by MINLP, European Journal of Operational Research, 105, 594, 10.1016/S0377-2217(97)00066-0 2001, vol. 2241 Laird, 2006, A mixed integer approach for obtaining unique solutions in source inversion of drinking water networks, ASCE Journal of Water Resource Management and Planning, 132, 242, 10.1061/(ASCE)0733-9496(2006)132:4(242) Leyffer, 2001, Integrating SQP and branch-and-bound for mixed integer nonlinear programming, Computational Optimization & Applications, 18, 295, 10.1023/A:1011241421041 Linderoth, 1999, A computational study of search strategies for mixed integer programming, INFORMS Journal of Computing, 11, 173, 10.1287/ijoc.11.2.173 CMU/IBM MINLP Project. http://egon.cheme.cmu.edu/ibm/page.htm J. Nocedal, A. Wächter, R.A. Waltz, Adaptive barrier strategies for nonlinear interior methods, Research Report RC 23563, IBM T.J. Watson Research Center, Yorktown, USA, 2005 Padberg, 1991, A branch-and-cut algorithm for the resolution of large scale symmetric travelling salesman problems, SIAM Review, 33, 60, 10.1137/1033004 Quesada, 1992, An LP/NLP based branched and bound algorithm for convex MINLP optimization problems, Computers and Chemical Engineering, 16, 937, 10.1016/0098-1354(92)80028-8 Raman, 1994, Modeling and computational techniques for logic based integer programming, Computers and Chemical Engineering, 18, 563, 10.1016/0098-1354(93)E0010-7 D.E. Ravemark, Optimization models for design and operation of chemical batch processes, Ph.D. Thesis, Swiss Federal Institute of Technology, 1995 N.W. Sawaya, Reformulations, relaxations and cutting planes for generalized disjunctive programming, Ph.D. Thesis, Chemical Engineering Department, Carnegie Mellon University, 2006 SBB. http://www.conopt.com/sbb/SBB_announcement.htm Stubbs, 1999, A branch-and-cut method for 0-1 mixed convex programming, Mathematical Programming, 86, 515, 10.1007/s101070050103 Tawarmalani, 2004, Global optimization of mixed-integer nonlinear programs: A theoretical and computational study, Mathematical Programming, 99, 563, 10.1007/s10107-003-0467-6 Turkay, 1996, Logic-based MINLP algorithms for the optimal synthesis of process networks, Computers & Chemical Engineering, 20, 959, 10.1016/0098-1354(95)00219-7 Vechietti, 1999, LOGMIP: A disjunctive 0-1 non-linear optimizer for process systems models, Computers & Chemical Engineering, 23, 555, 10.1016/S0098-1354(98)00293-2 Viswanathan, 1990, A combined penalty function and outer-approximation method for MINLP optimization, Computers & Chemical Engineering, 14, 769, 10.1016/0098-1354(90)87085-4 Wächter, 2005, On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming, Mathematical Programming Westerlund, 1995, An extended cutting plane method for solving convex MINLP problems, Computers & Chemical Engineering, 19, 131, 10.1016/0098-1354(95)87027-X Wolsey, 1998