Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A region is given by , , and . Find its corner points: the lines and meet in one corner, and the line meets the axis in another. Check the other axis intersections against the rules. Say how many corner points there are and whether the region is bounded.
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.
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 two slanted lines. Adding and gives , so and . The point passes both rules, so it is a corner.
Step 2. The axes. The line meets the axis at . There is true, so is a corner. It meets the axis at , but then is more than , so that point fails. The line meets the axis at , but then is less than , so that point fails. It meets the axis at , which has .
Step 3. Count. The corners are and : two corner points.
Step 4. Bounded? The point gives and , so it is feasible. Moving further along the line stays feasible, so the region is unbounded.
Answer: corner points, at and , and the region is unbounded.
Log in to join the discussion.
Loading…