Share
Explore BrainMass

# algebraic notation

A land trust has received a \$130,000 donation to save flying squirrels. They have identified five different areas to target as ecological reserves for flying squirrels. Three of the projects are in Oregon and two are in Washington. Each of the Oregon reserves would require a \$70,000 investment and would each provide habitat for 21 squirrels. Each of the Washington projects would require a \$40,000 investment and would provide habitat for 11 squirrels. Their objective is to choose the mix of projects that will maximize the number of flying squirrels they are able to save while staying within their budget.

a) Formulate this problem in algebraic notation.

b) Graph the feasible region and find the optimal solution graphically (assuming projects are divisible). How many squirrels are saved?

c) Now assume that the projects are indivisible (integer variables). Graph the feasible region (you can add to your graph in b) and find the new optimal solution.

d) Do you get the same solution for c as you would if you rounded your answer for b to the nearest integer? Discuss.

#### Solution Summary

Graph the feasible region and find the optimal solution graphically (assuming projects are divisible). How many squirrels are saved?

\$2.19