A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
From MaRDI portal
Publication:439452
DOI10.1016/J.EJOR.2011.10.002zbMATH Open1244.90199OpenAlexW1996414336MaRDI QIDQ439452FDOQ439452
Authors: Juan P. Ruiz, Ignacio E. Grossmann 
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.002
Recommendations
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Convex relaxations for mixed-integer nonlinear programs
- A hierarchy of relaxations for linear generalized disjunctive programming
- 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
combinatorial optimizationconvex programmingdisjunctive programminggeneralized disjunctive programmingtight relaxations
Cites Work
- BARON: A general purpose global optimization software package
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Title not available (Why is that?)
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Generalized Benders decomposition
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive Programming
- Title not available (Why is that?)
- An algorithm for disjunctive programs
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- A hierarchy of relaxations for linear generalized disjunctive programming
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
Cited In (15)
- Global optimization of disjunctive programs
- Cutting plane algorithm for convex generalized disjunctive programs
- Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
- A hierarchy of relaxations for linear generalized disjunctive programming
- A disjunctive model to analyze and redefine the logistic of replenishing goods of retailing stores
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Generalized disjunctive programming: solution strategies
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
Uses Software
This page was built for publication: A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439452)
