An algorithm for disjunctive programs
From MaRDI portal
The standard solution technique for linear problems complicated by disjunctions is to re-express each disjunction in terms of binary variables and solve the resulting mixed integer problem. An algorithm based on the logical relationships among constraints is proposed and its advantages are shown.
Recommendations
- Disjunctive programming: Properties of the convex hull of feasible points
- A finite cutting plane method for facial disjunctive programs
- Solving problems with min-type functions by disjunctive programming
- Disjunctive programming
- Review of nonlinear mixed-integer and disjunctive programming techniques
Cites work
- Correction to Disjunctive programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- scientific article; zbMATH DE number 3891096 (Why is no real title available?)
- scientific article; zbMATH DE number 3713449 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Modelling with integer variables
- Optimization with disjunctive constraints
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
Cited in
(33)- Modelling either-or relations in integer programming
- An alternative explanation of disjunctive formulations
- Tight bounds for capacities
- Constraint programming and operations research
- Global optimization of disjunctive programs
- Optimizing invasive species management: a mixed-integer linear programming approach
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Solving problems with min-type functions by disjunctive programming
- Mixed logical-linear programming
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Mathematical programming formulations for piecewise polynomial functions
- Global optimization for max-plus linear systems and applications in distributed systems
- Globally optimal solutions of max-min systems
- Decomposition and search techniques in disjunctive programs for portfolio selection
- Mixed integer linear programming formulation techniques
- Disjunctive Programs with Set Constraints
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
- Disjunctive Programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- scientific article; zbMATH DE number 1873242 (Why is no real title available?)
- No Efficient Disjunction or Conjunction of Switch-Lists
- Stable classes and operator pairs for disjunctive programs
- A unified approach to mixed-integer optimization problems with logical constraints
- scientific article; zbMATH DE number 3298488 (Why is no real title available?)
- Approximately global optimal control for max-plus linear systems and its application on load distribution
- New classes of facets for complementarity knapsack problems
- New classes of facets for complementarity knapsack problems
- Lift-and-project for mixed 0-1 programming: recent progress
- 50 years of mixed-integer nonlinear and disjunctive programming
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Projection, lifting and extended formulation integer and combinatorial optimization
- An incremental algorithm for computing ranked full disjunctions
This page was built for publication: An algorithm for disjunctive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173796)
