For the following linear programs, graph each constraint, indicating its feasible region, and then indicate the overall feasible region. Show all your work as I did in lecture, including the test points. Dont just give me the graph without any work. Be sure you indicate the scale (units per block) on your graph paper for the problem, and also be sure to label the axes. Please follow the convention I require in this class in having the earlier letter of the alphabet on the horizontal axis, and the later letter on the vertical axis. If you dont do this, the graph wont be graded. You should use the graph paper I handed out in class. I have set up problems so that you will be using one side for each graph.

3. Max 2A + 3B

s. t.

5A + 5B 350 Constraint 1

A + 9B 90 Constraint 2

A 20 Constraint 3

A, B 0

4. Max 2C + 3W

s. t.

C + 2W 60 Constraint 1

5C + 3W 150 Constraint 2

2.5C 25 Constraint 3

A, B 0