On 7/11/07, John Randall <[EMAIL PROTECTED]> wrote:
> [2] I'm not trying to maximize value, I'm trying to keep it from exceeding > a threshold. More precisely, I'm trying to find an exact threshold. > This is the same problem, isn't it? You are finding some combination of dishes that maximize the amount of money spent, subject to the constraint it does not exceed a certain value.
I'm not sure I understand your questions, but... your description is adequately close to the problem I was trying to solve. However, I believe the problem I'm trying to solve is substantially simpler than an NP Complete problem. It's also different from the problem described on the page whose URL you posted earlier.
> My more long winded approach never concerns itself with the size of > this set How do you get an infinite number?
If the price limit gets increased, that algorithm introduces more instances of the dishes, as needed.
> In other words, either I'm missing something about what makes these > problems NP complete, or the problem I'm tackling is not really an > NP complete problem. (Most likely both.) > The integer knapsack problem is in P.
Ok. Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
