An improved framework for solving NLIPs with signomial terms in the objective or constraints to global optimality

Adams, 2007, Linear forms of nonlinear expressions: New insights on old ideas, Operations Research Letters, 35, 510, 10.1016/j.orl.2006.08.008 Adams, 2005, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, Annals of Operations Research, 140, 21, 10.1007/s10479-005-3966-4 Angira, 2006, Optimization of process synthesis and design problems: A modified differential evolution approach, Chemical Engineering Science, 61, 4707, 10.1016/j.ces.2006.03.004 Balas, 1985, Disjunctive programming and a hierarchy of relaxations for discrete optimization problems, SIAM Journal on Algebraic and Discrete Methods, 6, 466, 10.1137/0606047 Biegler, 2004, Retrospective on optimization, Computers & Chemical Engineering, 28, 1169, 10.1016/j.compchemeng.2003.11.003 Chang, 2000, A linearization method for mixed 0–1 polynomial programs, Computers & Operations Research, 27, 1005, 10.1016/S0305-0548(99)00071-4 Floudas, 1999, Global optimization in design and control of chemical process systems, Journal of Process Control, 10, 125, 10.1016/S0959-1524(99)00019-0 Floudas, 2000, Deterministic global optimization: Theory, methods and application, Vol. 37 Floudas, 2009, A review of recent advances in global optimization, Journal of Global Optimization, 45, 3, 10.1007/s10898-008-9332-8 Glover, 1975, Improved linear integer programming formulations of nonlinear integer problems, Management Science, 22, 455, 10.1287/mnsc.22.4.455 Glover, 1973, Further reduction of zero-one polynomial programs to zero-one linear programming problems, Operations Research, 21, 156, 10.1287/opre.21.1.156 Glover, 1974, Converting the 0–1 polynomial programming problem to a 0–1 linear program, Operations Research, 22, 180, 10.1287/opre.22.1.180 Gounaris, 2008, Convexity of products of univariate functions and convexification transformations for geometric programming, Journal of Optimization Theory and Applications, 138, 407, 10.1007/s10957-008-9402-6 Hammer, 1968 Ibaraki, 1976, Integer programming formulation of combinatorial optimization problems, Discrete Mathematics, 16, 39, 10.1016/0012-365X(76)90091-1 Li, 1994, Global optimization for mixed 0–1 programs with convex or separable continuous functions, Journal of the Operational Research Society, 45, 1068, 10.1057/jors.1994.172 Li, 2009, Global optimization for generalized geometric programs with mixed free-sign variables, Operations Research, 57, 701, 10.1287/opre.1080.0586 Li, 2009, A superior representation method for piecewise linear functions, INFORMS Journal on Computing, 21, 314, 10.1287/ijoc.1080.0294 Li, 2006 Li, 2003, A distributed global optimization method for packing problems, Journal of the Operational Research Society, 54, 419, 10.1057/palgrave.jors.2601528 Lu, 2010, Convex relaxation for solving posynomial programs, Journal of Global Optimization, 46, 147, 10.1007/s10898-009-9414-2 Lundell, 2009, Convex underestimation strategies for signomial functions, Optimization Methods and Software, 24, 505, 10.1080/10556780802702278 Lundell, 2009, Some transformation techniques with applications in global optimization, Journal of Global Optimization, 43, 391, 10.1007/s10898-007-9223-4 Maranas, 1997, Global optimization in generalized geometric programming, Computers & Chemical Engineering, 21, 351, 10.1016/S0098-1354(96)00282-7 Pörn, 2008, Global solution of optimization problems with signomial parts, Discrete Optimization, 5, 108, 10.1016/j.disopt.2007.11.005 Pörn, 1999, Convexification of different classes of non-convex MINLP problems, Computers & Chemical Engineering, 23, 439, 10.1016/S0098-1354(98)00305-6 Sandgren, 1990, Nonlinear integer and discrete programming in mechanical design optimization, Journal of Mechanical Design, 112, 223, 10.1115/1.2912596 Sherali, 1990, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM Journal on Discrete Mathematics, 3, 411, 10.1137/0403036 Sherali, 1994, A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems, Discrete Applied Mathematics, 52, 83, 10.1016/0166-218X(92)00190-W Shin, 1990, A penalty approach for nonlinear optimization with discrete design variables, Engineering Optimization, 16, 29, 10.1080/03052159008941163 Till, 2004, Applied hybrid system optimization: An empirical investigation of complexity, Control Engineering Practice, 12, 1291, 10.1016/j.conengprac.2004.04.003 Tsai, 2002, Global Optimization for signomial discrete programming problems in engineering design, Optimization and Engineering, 34, 613, 10.1080/03052150215719 Tsai, 2008, Global optimization of signomial mixed-integer nonlinear programming problems with free variables, Journal of Global Optimization, 42, 39, 10.1007/s10898-007-9211-8 Vielma, 2011, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Mathematical Programming, 128, 49, 10.1007/s10107-009-0295-4 Vielma, 2010, Mixed-integer models for nonseparable piecewise-linear optimization: Unifying framework and extensions, Operations Research, 58, 303, 10.1287/opre.1090.0721 Vielma, 2010, A note on: “A superior representation method for piecewise linear functions”, INFORMS Journal on Computing, 22, 493, 10.1287/ijoc.1100.0379 Watters, 1967, Reduction of integer polynomial programming problems to zero-one linear programming problems, Operations Research, 15, 1171, 10.1287/opre.15.6.1171 Zangwill, 1965, Media selection by decision programming, Journal of Advertising Research, 5, 30