A simplification for some disjunctive formulations

DOI10.1016/0377-2217(88)90013-6zbMath0647.90055OpenAlexW2059745600MaRDI QIDQ1104856

Robert G. Jeroslow

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90013-6

zbMATH Keywords

convex hullnon-empty polyhedra

Mathematics Subject Classification ID

Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Related Items (12)

Representation for multiple right-hand sides ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Mixed integer linear programming formulations for probabilistic constraints ⋮ Projecting systems of linear inequalities with binary variables ⋮ Incremental and encoding formulations for mixed integer programming ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding ⋮ Worst-case analysis of clique MIPs ⋮ An alternative explanation of disjunctive formulations ⋮ Between steps: intermediate relaxations between big-M and convex hull formulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization with disjunctive constraints
• Mixed integer minimization models for piecewise-linear functions of a single variable
• A converse for disjunctive constraints
• Integer programming formulation of combinatorial optimization problems
• Representations of unbounded optimization problems as integer programs
• Integer and mixed-integer programming models: General properties
• Modelling with integer variables
• Experimental Results on the New Techniques for Integer Programming Formulations
• A theoretical and computational comparison of “equivalent” mixed-integer formulations
• Polyhedral annexation in mixed integer and combinatorial programming
• Branch and Bound Methods for Mathematical Programming Systems
• Disjunctive Programming
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs

This page was built for publication: A simplification for some disjunctive formulations