D1 - Linear Programming

Question 0

What areas do you shade?

Answer 0

The region that does not satisfy the inequality.

Question 1

How do you indicate strict inequalities?

Answer 1

< or > use a dashed line as the line itself is not included in the region.

> _ or _< use a solid line as the line is included in the region.

Question 2

How do you use the objective line method?

Answer 2

Move a ruler along the line and find optimal solution.

For a maximum point look or the last point covered as the line leaves the feasible region.

Do min look for the first point as it enters.

Question 3

How so you use the vertex testing method?

Answer 3

Find the co ordinaries of the feasible region.
Apply the function to each vertex.
Select the vertex which gives the optimum solution.

Question 4

How do you find the optimum solution for only integer values?

Answer 4

Use the objective line method to find the first/last point covered.

Locate the optimum solution, and test each of the 4 integers surrounding it.