The Math Forum

Search All of the Math Forum:

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

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

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

Advanced Search

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

Posts: 2,637
Registered: 1/8/12
Re: disjunctive constraints in integer linear programming
Posted: Apr 11, 2013 9:53 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Thu, 11 Apr 2013, 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?

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

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.