More Complex Feasible Regions

This page requires a Java capable browser.

The feasible region is bounded by the following points:

2 bags of high grade and 7 bags of low grade;
3 bags of high grade and 6 bags of low grade;
5 bags of high grade and no bags of low grade; and
2 bags of high grade and no bags of low grade.

Note that all of these are feasible since they are on the boundary of the feasible region.

Exercise 5.

This page requires a Java capable browser.

a)

xy
02.7
02
20
4.80
2.62.7

This page requires a Java capable browser.

b)

xy
06
03
2.43

Notice that the second constraint has no effect on the feasible region, since every non-negative point that satisfies the first constraint also satisfies the second. The second constraint is redundant.
This page requires a Java capable browser.

c)

xy
09.1
02
1.30
50
61

Back to the questions