A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
From MaRDI portal
(Redirected from Publication:439452)
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
Cites work
- scientific article; zbMATH DE number 3891096 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A branch-and-cut method for 0-1 mixed convex programming
- A hierarchy of relaxations for linear generalized disjunctive programming
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
- An algorithm for disjunctive programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- BARON: A general purpose global optimization software package
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Convex programming for disjunctive convex optimization
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generalized Benders decomposition
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Solving mixed integer nonlinear programs by outer approximation
- 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
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
- 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
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- A disjunctive model to analyze and redefine the logistic of replenishing goods of retailing stores
- 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
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)
