(b) Three-stage SP problem: Seat allocation, passenger acceptance policy, and seat occupation Assume that the data in...
Question:
(b) Three-stage SP problem: Seat allocation, passenger acceptance policy, and seat occupation Assume that the data in (a) correspond to the demand for seat reservations. Assume that there is a 50% probability that all clients with a reservation effectively show up and that 10% or 20% no-shows occur with equal probability. Assume the top management estimates the reward of an occupied seat to be 4, 2, and 1 in the first-class, business class, and economy class, respectively, and the penalty for a denied reservation is 1.5 times the reward. Model this situation as a three-stage program, with first-stage decisions as before, second-stage decisions corresponding to the number of accepted Reservations, and third-stage decisions corresponding to effective seat occupation (Please note that the third stage is a recourse program with a reward for each occupied seat and a penalty for each denied reservation).
(c) Two-Stage SP problem: passenger acceptance policy and seat occupation (no upgrade) Consider now the situation where the number of seats has been fixed to 12, 24, and 140 for the first class, business class, and economy class, respectively. Model the corresponding problem as a recourse program. Find the optimal acceptance policy with the data of part (b). To simplify, assume that passengers with a denied reservation are not seated in a higher class even if a seat is available there.
(d) Two-Stage SP problem: passenger acceptance policy and seat occupation (upgrade is possible) It is the same as part (c) except that passengers with a denied reservation are seated in a higher class if a seat is available there.
Modeling the Dynamics of Life Calculus and Probability for Life Scientists
ISBN: 978-0840064189
3rd edition
Authors: Frederick R. Adler