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 ]
 RGVickson@shaw.ca Posts: 1,677 Registered: 12/1/07
Re: disjunctive constraints in integer linear programming
Posted: Apr 12, 2013 3:56 AM

On Thursday, April 11, 2013 12:24:57 PM UTC-7, d.inf...@gmail.com wrote:
> 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!

If x is real valued (or even rational) the strict inequality x < 0 cannot be modelled exactly; instead, one must replace it by x <= =e, where e > 0 is "small". If x is also integer (<>0) then, of course, x < 0 is the same as x <= -1, so that is again OK.

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