Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
DOI10.1007/978-1-4614-1927-3_4zbMATH Open1242.90133OpenAlexW1840577010MaRDI QIDQ2897295FDOQ2897295
Authors: Ignacio E. Grossmann, Juan P. Ruiz 
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Generalized_Disjunctive_Programming_A_Framework_for_Formulation_and_Alternative_Algorithms_for_MINLP_Optimization/6467024
Recommendations
- Generalized disjunctive programming: solution strategies
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A hierarchy of relaxations for linear generalized disjunctive programming
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cited In (23)
- Global optimization of disjunctive programs
- Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- On quantile cuts and their closure for chance constrained optimization problems
- Comparison of MINLP formulations for global superstructure optimization
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Disjunctive programming and the generalized Leontief input-output model
- Achieving MILP feasibility quickly using general disjunctions
- Adjustable robust optimization with objective uncertainty
- On the quantile cut closure of chance-constrained problems
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- 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 hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- A trust-region framework for derivative-free mixed-integer optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Generalized disjunctive programming: solution strategies
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A note on solving MINLP's using formulation space search
Uses Software
This page was built for publication: Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897295)
