Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
DOI10.1007/S10479-005-3451-0zbMATH Open1091.90056OpenAlexW2049847730MaRDI QIDQ817192FDOQ817192
Authors: Ignacio E. Grossmann, Sang Bum Lee
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3451-0
Recommendations
- Generalized disjunctive programming: solution strategies
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Optimization of discrete-continuous dynamic systems based on disjunctive programming
global optimizationmixed-integer programminggeneralized disjunctive programminglogic-based programming
Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11)
Cites Work
- An Automatic Method of Solving Discrete Programming Problems
- Partitioning procedures for solving mixed-variables programming problems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Title not available (Why is that?)
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- 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
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Generalized Benders decomposition
- Title not available (Why is that?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Outline of an algorithm for integer solutions to linear programs
- Solving Large-Scale Zero-One Linear Programming Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Title not available (Why is that?)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Mixed logical-linear programming
- Title not available (Why is that?)
- An algorithm for disjunctive programs
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Title not available (Why is that?)
- A tree-search algorithm for mixed integer programming problems
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Valid inequalities for mixed 0-1 programs
- A global optimization algorithm for linear fractional and bilinear programs
- A hierarchy of relaxations for linear generalized disjunctive programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Title not available (Why is that?)
Cited In (15)
- Title not available (Why is that?)
- Cutting plane algorithm for convex generalized 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
- A review of recent advances in global optimization
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Title not available (Why is that?)
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Optimization of discrete-continuous dynamic systems based on disjunctive programming
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Generalized disjunctive programming: solution strategies
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
Uses Software
This page was built for publication: Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817192)