Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
from the historical data using least square regression. Generally b_j < 0 because with increasing price, demand decreases and vice versa. Our objective X is non-linear (quadratic) in p: (a_j*p_j + b_j*p²_j). 0 ≤ p_j ≤ Qj for j = 1 to 9 to handle the maximum seat price constraint. Demands are