Representation for multiple right-hand sides

DOI10.1007/BF01588775zbMath0717.90100OpenAlexW1998952810MaRDI QIDQ2638974

Yanyan Li

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588775

zbMATH Keywords

NP-hardlinear constraintsdifferent right-hand sidesunion of the polyhedra

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Linear inequalities of matrices (15A39) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (9)

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

Cites Work

• A simplification for some disjunctive formulations
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

This page was built for publication: Representation for multiple right-hand sides