## Monday, December 6, 2010

### Ch 3.4 Linear Programming

For my chapter 4 project, I had to create my own linear programming problem and graph it. This was my problem: Andy is planing a green roof that will cover 750 square feet. He uses two types of plants; California Poppy and Oregon Sunshine. Each California Poppy covers 1 square fee ,and each Oregon Sunshine covers 1.5 square feet. California Poppy and Oregon Sunshine both cost \$3 dollars each plant, and he must spend less than \$2,000. First I made four different equations. C is less than or equal to 0 and O is less than of equal to 0. C standing for California poppy and 0 for Oregon Sunshine. Also 1c+1.5o is less than or equal to 750 and 3c+3o is less than or equal to 2,000. I have to make those two equations y intercept(y=mx+b). Then it becomes C is less than or equal to -1.5o+75, and C is less than or equal to 2000/3 which is around 666. Then I graph them each separate and one together for their feasible region. The vertices are (0,0), (666.666,0), (750,500), (0,500)