Walt Disney World is planning a new shuttle system for patrons from three parking areas to two ticket booths Shuttles from parking area A can carry up to 100 patrons per hour, and shuttles from parking area B can carry up to 65 patrons per hour. Shuttles from parking area C can carry 75 patrons per hour. Patrons then will walk from the ticket booths to the entrance. It is estimated that ticket booth 1 can process 150 patrons per hour and ticket booth 2 can process 100 patrons per hour. Ticket Booth1 Entrance Ticket Booth 2 a) Draw a network that can be used to determine the maximum number of patrons that will be able to enter the theme park per hour. (Reminder: Your network will need a start (source) and end (terminal) node. If there is not a single starting node, you can create an artificial one) Formulate an LP whose solution will provide the maximum flow of patrons. Use LINGO or Solver to solve the LP from part (b). What is the maximum flow of patrons per hour? What increase of resources would you recommend to Walt Disney World if they would like to increase the number of patrons that can enter the park per hour? (use the topic we learned in Linear Programming to interpret the effects of changing the right hand sides of the constraints by looking at the solution report) b) c) d) Walt Disney World is planning a new shuttle system for patrons from three parking areas to two ticket booths Shuttles from parking area A can carry up to 100 patrons per hour, and shuttles from parking area B can carry up to 65 patrons per hour. Shuttles from parking area C can carry 75 patrons per hour. Patrons then will walk from the ticket booths to the entrance. It is estimated that ticket booth 1 can process 150 patrons per hour and ticket booth 2 can process 100 patrons per hour. Ticket Booth1 Entrance Ticket Booth 2 a) Draw a network that can be used to determine the maximum number of patrons that will be able to enter the theme park per hour. (Reminder: Your network will need a start (source) and end (terminal) node. If there is not a single starting node, you can create an artificial one) Formulate an LP whose solution will provide the maximum flow of patrons. Use LINGO or Solver to solve the LP from part (b). What is the maximum flow of patrons per hour? What increase of resources would you recommend to Walt Disney World if they would like to increase the number of patrons that can enter the park per hour? (use the topic we learned in Linear Programming to interpret the effects of changing the right hand sides of the constraints by looking at the solution report) b) c) d)
