Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: disjunctive constraints in integer linear programming
Replies: 9   Last Post: Apr 14, 2013 2:43 AM

 Messages: [ Previous | Next ]
 d.info.sign@gmail.com Posts: 2 Registered: 4/11/13
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 non-negative 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 co-efficients are -1, 0, 1 exist?

Thank you!

Date Subject Author
4/11/13 d.info.sign@gmail.com
4/11/13 quasi
4/11/13 d.info.sign@gmail.com
4/12/13 quasi
4/11/13 William Elliot
4/12/13 RGVickson@shaw.ca
4/12/13 quasi
4/13/13 RGVickson@shaw.ca
4/13/13 RGVickson@shaw.ca
4/14/13 quasi