Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
暂无分享,去创建一个
[1] Ignacio E. Grossmann,et al. Cutting planes for improved global logic-based outer-approximation for the synthesis of process networks , 2016, Comput. Chem. Eng..
[2] N. Sahinidis,et al. Convexification and Global Optimization in Continuous And , 2002 .
[3] Ignacio E. Grossmann,et al. Strengthening of lower bounds in the global optimization of Bilinear and Concave Generalized Disjunctive Programs , 2010, Comput. Chem. Eng..
[4] I. Grossmann,et al. Optimal Design of Distributed Wastewater Treatment Networks , 1998 .
[5] Kurt M. Anstreicher,et al. Institute for Mathematical Physics Semidefinite Programming versus the Reformulation–linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming Semidefinite Programming versus the Reformulation-linearization Technique for Nonconvex Quadratically Constrained , 2022 .
[6] Christodoulos A. Floudas,et al. Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications) , 2005 .
[7] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[8] Hanif D. Sherali,et al. A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..
[9] I. Grossmann,et al. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .
[10] Ignacio E. Grossmann,et al. Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks , 2011, Optim. Lett..
[11] Ignacio E. Grossmann,et al. Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs , 2013, Comput. Chem. Eng..
[12] Ignacio E. Grossmann,et al. Logic-based outer approximation for globally optimal synthesis of process networks , 2005, Comput. Chem. Eng..
[13] Ignacio E. Grossmann,et al. A Branch and Contract Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms , 1999, J. Glob. Optim..
[14] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .
[15] Christodoulos A. Floudas,et al. A review of recent advances in global optimization , 2009, J. Glob. Optim..
[16] James E. Falk,et al. Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..
[17] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[18] I. Grossmann,et al. New algorithms for nonlinear generalized disjunctive programming , 2000 .
[19] Christodoulos A. Floudas,et al. Deterministic global optimization - theory, methods and applications , 2010, Nonconvex optimization and its applications.
[20] Nikolaos V. Sahinidis,et al. Convex envelopes generated from finitely many compact convex sets , 2013, Math. Program..
[21] Sebastián Ceria,et al. Convex programming for disjunctive convex optimization , 1999, Math. Program..
[22] I. Grossmann,et al. Relaxation strategy for the structural optimization of process flow sheets , 1987 .
[23] Ignacio E. Grossmann,et al. Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation , 2003, Comput. Optim. Appl..
[24] Juan P. Ruiz,et al. Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization , 2012 .
[25] Leo Liberti,et al. An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms , 2006, J. Glob. Optim..
[26] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[27] I. Grossmann,et al. Systematic modeling of discrete-continuous optimization models through generalized disjunctive programming , 2013 .
[28] Aldo R. Vecchietti,et al. Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations , 2003, Comput. Chem. Eng..
[29] Egon Balas. Disjunctive Programming , 2010, 50 Years of Integer Programming.
[30] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[31] Ignacio E. Grossmann,et al. A hierarchy of relaxations for nonlinear convex generalized disjunctive programming , 2012, Eur. J. Oper. Res..
[32] Ignacio E. Grossmann,et al. Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs , 2015, INFORMS J. Comput..
[33] E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .
[34] Ignacio E. Grossmann,et al. Using redundancy to strengthen the relaxation for the global optimization of MINLP problems , 2011, Comput. Chem. Eng..
[35] R. Raman,et al. Modelling and computational techniques for logic based integer programming , 1994 .
[36] I. Grossmann,et al. Logic-based MINLP algorithms for the optimal synthesis of process networks , 1996 .
[37] I. Grossmann. Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques , 2002 .
[38] I. Karimi,et al. Piecewise MILP under‐ and overestimators for global optimization of bilinear programs , 2008 .
[39] Ignacio E. Grossmann,et al. Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks , 2003, Comput. Chem. Eng..
[40] I. Grossmann,et al. A combined penalty function and outer-approximation method for MINLP optimization : applications to distillation column design , 1989 .