Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
aisle(rows 11–20), aisle(rows 21–30), middle(rows 1–10), middle(rows 11–20), middle(rows 21–30) We want to find 9 different prices corresponding to each type. Each seat type has a demand function associated with it denoted by d_j(p) where j is the seat type and it is a function of price p. Each