Monday, December 6, 2010

Ch 3.4 Linear Programming

For my project I chose amusement parks. My problem is: Donny wants to build an amusement park that will cover at least 800 square feet. He will have two types of rides in his amusement park: roller coasters and Kiddy rides. Each roller coaster will cover 40 square feet. Each kiddy ride will cover 20 square feet. Each ride cost $200 and Donny must only stay within his budget of $8000. Write the constraints, and graph the feasible region. First i write the constraints which are: r is greater than or equal to zero, k is greater than of equal to zero, 40r plus 20k is less than or equal to 800, and 200r plus 200k is less than or equal to 8000. Then I graph each constraint in an individual color. After that is established i combine all the graphs onto one which is called a feasible region. i then find the vertices which are (9,0), (40,0), (20,40,), (0,40).
Ebony Triangle