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 . There are five boundary lines. Find all the corner points. Count them, and add up their coordinates.
A corner point is a feasible meeting point of two boundary lines. List every boundary line, including and . Solve each pair, and keep a solution only if it obeys every inequality.
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 on the axes. is feasible. On the axis the lines give , and . Only obeys and , so it is the corner. On the axis the lines give , and . Only obeys every rule.
Step 2. The slanted pairs. and meet at . Check: , so it is a corner. and meet at . Check: , so it is a corner. The pair and meet at , but then is more than , so that point fails.
Step 3. Count and add. The corners are , , , and . That is corners, and .
Answer: corner points and the sum of their coordinates is .
Log in to join the discussion.
Loading…