Global optimization of disjunctive programs
From MaRDI portal
Recommendations
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Solving problems with min-type functions by disjunctive programming
- An algorithm for disjunctive programs
Cites work
- scientific article; zbMATH DE number 4162324 (Why is no real title available?)
- scientific article; zbMATH DE number 6108474 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A class of problems where dual bounds beat underestimation bounds
- A hierarchy of relaxations for linear generalized disjunctive programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- An algorithm for disjunctive programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Critical sets in parametric optimization
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive optimization: Critical point theory
- Disjunctive programming: Properties of the convex hull of feasible points
- Dual bounding procedures lead to convergent branch-and-bound algorithms
- Empirical evidence for the Birch and Swinnerton-Dyer conjectures for modular Jacobians of genus 2 curves
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Interval Methods for Systems of Equations
- Lift-and-project for mixed 0-1 programming: recent progress
- Mixed logical-linear programming
- Modelling with integer variables
- Optimal centered forms
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Solving mixed integer nonlinear programs by outer approximation
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(7)- An adaptive agent-based process model for optimizing innovative design
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- scientific article; zbMATH DE number 6311514 (Why is no real title available?)
This page was built for publication: Global optimization of disjunctive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679482)
