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 ]
quasi

Posts: 10,317
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

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 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?

quasi



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

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.