Section 3.2 expands on the idea of graphing feasible regions which will be useful in solving linear programming problems.It refers to the inequalities as constraints, which will be necessary in the next lesson. A linear programming problem aims to maximize or minimize an objective function over list of constraints.Look at the graph on page 121. It shows the same function z = 3x + 4y being tested at various points in the feasible region.

1.What is a corner point?

2.Why are they important?

3.Does an objective function always have a maximum or minimum?Explain your answer.

\f