Drexel dragonThe Math ForumDonate to the Math Forum


Math Forum
 Ask Dr. Math
 Discussions
 Internet Newsletter
 MathTools
 Problems of the Week
 Teacher2Teacher
 Teacher Exchange
 Workshops

Search All of the Math Forum:
Browse our Internet Mathematics Library

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


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

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

Advanced Search
Reply to this Topic Reply to this Topic

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

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

On Nov 4, 7:27 pm, "analys...@hotmail.com" <analys...@hotmail.com>
wrote:
>
> Yes, please post your solution.
>
> Right now I am thinking of following the suggestion of implementing
> primal simplex with bounded variables with only two rows.

Sorry for the delay; the INFORMS conference has kept me hopping. My
algorithm is a bit long to explain here, so I posted it on my blog
(http://orinanobworld.blogspot.com/2010/11/continuous-knapsack-with-
count.html). I have proof-of-concept code (in Java), although I
didn't bother to code the bisection search for the first phase (I just
brute-force it). If you want to see the code, you can reply directly
to me (or to the list, or drop a comment on my blog, your choice) and
send me your e-mail address.

/Paul

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

[Privacy Policy] [Terms of Use]

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