
disjunctive constraints in integer linear programming
Posted:
Apr 11, 2013 3:24 PM


I have an integer linear programming problem as follows:
The constraints are either
x >= 0 y = u z = x + v
or
x < 0 y = u  x z = v
where y, z, u, v range over nonnegative integers. There are other unrelated constraints associated with u, v, y, z.
What's the most simple way to encode the disjunctive case? Does any linear encoding where all coefficients are 1, 0, 1 exist?
Thank you!

