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 ]

Posts: 12,067
Registered: 7/15/05
Re: disjunctive constraints in integer linear programming
Posted: Apr 11, 2013 4:04 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply wrote:
>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?

Why not just run two separate linear programs and choose
whichever of the two optimal solutions offers a better value
for the objective function?


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.