Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A small bakery has two rules for a day. The oven holds at most trays in all, so . The orders need at least units of effort, where a tray of loaves counts unit and a tray of cakes counts units, so . Also and . First find the largest value of over the points with . Then decide how many feasible points the bakery has.
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 corners. The region in the first quadrant is a triangle with corners , and .
Step 2. The value at each corner. is , and . So the largest value is .
Step 3. Compare. No allowed plan reaches , since the best it can do is . The second rule needs at least .
Answer: the largest value is and there are feasible points. The feasible region is empty.
Log in to join the discussion.
Loading…
The feasible region is the overlap of the regions of all the constraints, with and . It is bounded if a circle can enclose it, and unbounded if it runs on for ever. If the constraints contradict each other, the region is empty.