Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

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

Math Forum » Discussions » sci.math.* » sci.math

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 2
Registered: 4/11/13
disjunctive constraints in integer linear programming
Posted: Apr 11, 2013 3:24 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I have an integer linear programming problem as follows:

The constraints are either

x >= 0
y = u
z = x + v


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!

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum 1994-2015. All Rights Reserved.