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 . It is a triangle. Find its corners. Then find the maximum and the minimum of over the region.
For a bounded feasible region, work out at every corner point. The largest value is the maximum and the smallest value is the minimum. State the best point as well as the best value.
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 lines and meet at . The lines and meet at . The lines and meet at . All three obey every rule.
Step 2. The values. At , . At , . At , .
Step 3. Compare. The largest is and the smallest is .
Answer: the maximum is , at , and the minimum is , at .
Log in to join the discussion.
Loading…