## Monday, December 6, 2010

### Ch.3.4 Linear Programing Project

For my chapter4 Linear Programing project. George wants to buy tiles that will cover up to 800 square feet of his kitchen floor. He wants to buy two different colored tiles: Black and White tiles. Each black tile will cover 2 square feet. Each white tile will cover 4 square feet. Each tile costs \$4.00 and he can only spend \$1,000.
The variable X represents the number of black tiles and the variable Y represents the number of white tiles. From that word problem i can come up with 4 equations.

1) X is greater than or equal to zero.
2) Y is greater than or equal to zero.
3) 2x + 4y is less than or equal to 800 which will be Y is less than or equal to -1/2x + 200" when simplified.
4)4x + 4y is less than or equal to 1000 which will be "Y is less than or equal to -1x + 250" when simplified.

Each graph is shaded individually. The first equation is represented by the graph with orange shading, the second equation is represented by the graph with green shading, the third equation is represented by the graph with blue shading, and the last equation is represented by the graph with yellow shading. The last graph is shows the feasible region which is the space where all 4 graph's shading meet at.