Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
From MaRDI portal
Publication:506439
DOI10.1007/s10898-016-0401-0zbMath1359.90108OpenAlexW2275734143MaRDI QIDQ506439
Juan P. Ruiz, Ignacio E. Grossmann
Publication date: 1 February 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0401-0
Related Items
Pyomo.GDP: an ecosystem for logic based modeling and optimization development, Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint, An interleaved depth-first search method for the linear optimization problem with disjunctive constraints, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- A review of recent advances in global optimization
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A new reformulation-linearization technique for bilinear programming problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Convex envelopes generated from finitely many compact convex sets
- Deterministic global optimization. Theory, methods and applications
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
- Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs
- Jointly Constrained Biconvex Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
