A hierarchy of relaxations for nonlinear convex generalized disjunctive programming

DOI10.1016/j.ejor.2011.10.002zbMath1244.90199OpenAlexW1996414336MaRDI QIDQ439452

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

zbMATH Keywords

combinatorial optimizationconvex programmingdisjunctive programminggeneralized disjunctive programmingtight relaxations

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items

Pyomo.GDP: an ecosystem for logic based modeling and optimization development, Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs, Global optimization of disjunctive programs, A disjunctive model to analyze and redefine the logistic of replenishing goods of retailing stores, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables, Between steps: intermediate relaxations between big-M and convex hull formulations

Uses Software

• BARON
• Bonmin
• AlphaECP
• GAMS
• FilMINT

Cites Work

• Unnamed Item
• Unnamed Item
• A hierarchy of relaxations for linear generalized disjunctive programming
• An algorithmic framework for convex mixed integer nonlinear programs
• 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 improved branch and bound algorithm for mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• BARON: A general purpose global optimization software package
• A branch-and-cut method for 0-1 mixed convex programming
• Convex programming for disjunctive convex optimization
• Generalized Benders decomposition
• Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
• FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear 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
• Disjunctive Programming