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 the point where the two slanted lines meet. Then use the corners , , that point and to find the area of the region.
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 meeting point. Adding the two equations gives , so . Subtracting from gives . So .
Step 2. The area. Split the region into two triangles from the origin. The triangle with corners , and has base and height , so its area is . The triangle with corners , and has base along the axis and height , so its area is also .
Step 3. Add. .
Answer: the lines meet at and the area is square units.
Log in to join the discussion.
Loading…