Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A shopper mixes two packs, A and B. A pack of A has units of protein, units of calcium and unit of fibre. A pack of B has unit of protein, unit of calcium and units of fibre. The diet needs at least units of protein, at least units of calcium and at least units of fibre. Pack A costs pounds and pack B costs pounds. Find the cheapest diet and its cost.
A diet problem has needs that are minimums, so its constraints use and the feasible region is unbounded. Work out the cost at each corner. With positive prices the smallest corner cost is the minimum. When a price changes, the cheapest corner changes where two corner costs are equal.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The model. Minimise pounds subject to , , , and .
Step 2. The corners. The line meets the axis at . It meets at , . The lines and meet at . The line meets the axis at . At the calcium is , so the rule is met.
Step 3. The costs. At , . At , . At , . At , . The smallest is , and the region is unbounded with positive prices, so it is the minimum.
Step 4. Say it. Buy packs of A and packs of B. The cost is pounds.
Log in to join the discussion.
Loading…