Monday, December 6, 2010
Ch 3.4 Linear Programming
For my chapter 3.4 project i had to make up a linear programming problem. Daly is planning a green roof that will cover up to 400 square feet. He will use two types of plants: Monberry and rosemary. Each Monberry will cover up 1.5 square feet. Each Rosemary will cover 2 square feet. Each plant costs $2, and Daly needs to spend less than 1100. I graphed each M greater than or equal to 0, r is greater than or equal to 0, 1.5m + 2r is less than or equal to 400, and 2m + 2r is less than or equal to 2000 separately. Then i combined all the graphs to one graph to find the feasible region.