I am little new to this platform, but i think you guys can help me. I have a question that I cannot solve.
Here's the problem.
You can only carry $25$kg on your backpack. only choose one thing from each set. find the most survival point using mathematical programming.
I tried to use linear programming but my objective function was incorrect.
I tried to tag them as x1,x2,x3 or x1-1 , x1-2 x1-3 but I couldnt find how to model this question. I guess its dynamic modelling and I dont know that one.
Sorry for my bad English :) Thanks everyone for your help!
thank you for your help. you can find the graphic in picture. actually I dont know which method to use. please help.
Should I solve it with matrix?
This is such a tiny problem that it can be solved using bare common sense. Taking the largest object of each set gives $90$ survival points, but $10$ kg overweight. In order to cut back significantly on the weight we should stay with the largest defense object. Going back one step on each of food, water, and shelter costs $15$ survival points and saves $11$ kg. Going back two steps on one of these also costs $15$ survival points, but is insufficient concerning weight. We therefore should choose the first described option, resulting in 75 survival points.