Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
From MaRDI portal
Publication:3186647
DOI10.1287/ijoc.2015.0669zbMath1343.90054OpenAlexW200091770MaRDI QIDQ3186647
Ignacio E. Grossmann, Francisco Trespalacios
Publication date: 12 August 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4b662a62916285414364d5a4c72ebbd8badd89fc
Related Items
A disjunctive cut strengthening technique for convex MINLP, Pyomo.GDP: an ecosystem for logic based modeling and optimization development, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Disjunctive cuts in mixed-integer conic optimization, 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
Uses Software
Cites Work
- A hierarchy of relaxations for linear generalized disjunctive programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Solving mixed integer nonlinear programs by outer approximation
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Generalized Benders decomposition
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Mixed-integer nonlinear optimization
- A tree-search algorithm for mixed integer programming problems
