An algorithm for disjunctive programs

DOI10.1016/0377-2217(90)90419-CzbMath0744.90062OpenAlexW2021947147MaRDI QIDQ1173796

Nicholas Beaumont

Publication date: 25 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90419-c

zbMATH Keywords

disjunctions

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (20)

Constraint programming and operations research ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ 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 ⋮ Global optimization of disjunctive programs ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ Approximately global optimal control for max-plus linear systems and its application on load distribution ⋮ Globally optimal solutions of max-min systems ⋮ New classes of facets for complementarity knapsack problems ⋮ A hierarchy of relaxations for nonlinear convex generalized disjunctive programming ⋮ Global optimization for max-plus linear systems and applications in distributed systems ⋮ Mixed logical-linear programming ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ Optimizing invasive species management: a mixed-integer linear programming approach ⋮ Lift-and-project for mixed 0-1 programming: recent progress ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Modelling either-or relations in integer programming ⋮ Tight bounds for capacities ⋮ Logic-based modeling and solution of nonlinear discrete/continuous optimization problems ⋮ Projection, lifting and extended formulation integer and combinatorial optimization

Uses Software

• SCICONIC
• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization with disjunctive constraints
• Correction to Disjunctive programming
• Modelling with integer variables
• Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• 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

This page was built for publication: An algorithm for disjunctive programs