Solve Using Excel Solver

Solve in Excel Solver

1.2 A small airline, Ivy Air, flies between three cities: Ithaca, Newark, and Boston. They offer several flights but, for this problem, let us focus on the Friday afternoon flight that departs from Ithaca, stops in Newark, and continues to Boston. There are three types of passengers: (a) Those traveling from Ithaca to Newark. (b) Those traveling from Newark to Boston. (c) Those traveling from Ithaca to Boston. The aircraft is a small commuter plane that seats 30 passengers. The air- line offers three fare classes: (a) Y class: full coach. (b) B class: nonrefundable. C) M class: nonrefundable, 3-week advanced purchase. Ticket prices, which are largely determined by external influences (i.e., competitors), have been set and advertised as follows: Ithaca-Newark Newark-Boston Ithaca-Boston - Y 300 160 360 B 220 130 280 M 100 80 140 Based on past experience, demand forecasters at Ivy Air have determined the following upper bounds on the number of potential customers in each of the nine possible origin-destination/fare-class combinations: Ithaca-Newark Newark-Boston Ithaca-Boston Y 4 8 3 | 8 13 10 M 22 20 18 The goal is to decide how many tickets from each of the nine origin/ destination/fare-class combinations to sell. The constraints are that the plane cannot be overbooked on either of the two legs of the flight and that the number of tickets made available cannot exceed the forecasted maxi- mum demand. The objective is to maximize the revenue. Formulate this problem as a linear programming