Date: Apr 11, 2013 9:53 PM
Author: William Elliot
Subject: Re: disjunctive constraints in integer linear programming
On Thu, 11 Apr 2013, d.info.sign@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?

What does "encoding the disjunctive case" mean?