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.stat.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: non-discrete knapsack
Replies: 22   Last Post: Dec 24, 2010 6:47 PM

Advanced Search

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

Posts: 162
Registered: 12/7/09
Re: non-discrete knapsack
Posted: Oct 28, 2010 6:35 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Oct 28, 5:29 pm, "" <>

> What if we made the equality the main constraint and put the
> inequality in the Lagrangean?

No joy. Your only constraint then (absent upper bounds on x and y) is
x + y = 5 (plus the sign restrictions), so you'll get either (5, 0) or
(0, 5) as the solution, depending on the multiplier you use in the
relaxation. It turns out the ideal penalty multiplier is 1 (the dual
value of the capacity constraint in the original LP), in which case
(5, 0) and (0, 5) are both optimal in the relaxed problem -- as is (2,
3), thus satisfying the Ghost of Lagrange, but it's not an extreme
point in the relaxed problem, so you have no obvious way to find it.


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.