Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
From MaRDI portal
(Redirected from Publication:506439)
Recommendations
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
Cites work
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-cut method for 0-1 mixed convex programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- A new reformulation-linearization technique for bilinear programming problems
- A review of recent advances in global optimization
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex envelopes generated from finitely many compact convex sets
- Convex programming for disjunctive convex optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization. Theory, methods and applications
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- scientific article; zbMATH DE number 3891096 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Jointly Constrained Biconvex Programming
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Cited in
(8)- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability
- 50 years of mixed-integer nonlinear and disjunctive programming
This page was built for publication: Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506439)
