The Student Room Group

Decision 1 Linear programming

I'm doing a question and it asks me to find the number of combinations that would add up to the max profit I have, is there an easier way to do this instead of working through the coordinates in the feasible region and putting them into the equation I have for the profit? I just thought there would be a more efficient way to do it
Original post by mica-lwe
I'm doing a question and it asks me to find the number of combinations that would add up to the max profit I have, is there an easier way to do this instead of working through the coordinates in the feasible region and putting them into the equation I have for the profit? I just thought there would be a more efficient way to do it

It sounds like you're trying to solve the knapsack problem, which can be done heuristically with the first-fit algorithm but is quite hard to do efficiently. Can you post the actual question, please, because I'm pretty sure I've misunderstood?

Quick Reply

Latest