Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A hospital kitchen mixes two foods, P and Q. Each kilogram of P has unit of fibre and units of iron. Each kilogram of Q has units of fibre and unit of iron. A meal must have at least units of fibre and at least units of iron. Food P costs rupees a kilogram and food Q costs rupees. Find the cheapest meal and its cost. The corners of the region are , and .
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 rupees subject to , , and .
Step 2. The costs. At , . At , . At , . The smallest is .
Step 3. The test. The line has slope . The edges at have slopes and . Since , the line touches the region only at . So is the minimum.
Step 4. Say it. Use kg of P and kg of Q. The cost is rupees.
Check. Fibre is units and iron is units, both exactly met.
Log in to join the discussion.
Loading…