quasi
Posts:
11,254
Registered:
7/15/05


Re: disjunctive constraints in integer linear programming
Posted:
Apr 11, 2013 4:04 PM


d.info.sign 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 nonnegative integers. There are >other unrelated constraints associated with u, v, y, z. > >What's the most simple way to encode the disjunctive case?
Why not just run two separate linear programs and choose whichever of the two optimal solutions offers a better value for the objective function?
quasi

