Convexity and feedback in approximate dynamic programming for delivery time slot pricing
We consider the revenue management problem of finding profit-maximising prices for delivery time slots in the context of attended home delivery. This multi-stage optimal control problem admits a dynamic programming formulation that is intractable for realistic problem sizes due to the socalled “curs...
Asıl Yazarlar: | Lebedev, D, Margellos, K, Goulart, P |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
IEEE
2021
|
Benzer Materyaller
-
A dynamic programming framework for optimal delivery time slot pricing
Yazar:: Lebedev, D, ve diğerleri
Baskı/Yayın Bilgisi: (2020) -
Gradient bounded dynamic programming with submodular and concave extensible value functions
Yazar:: Lebedev, D, ve diğerleri
Baskı/Yayın Bilgisi: (2021) -
Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees
Yazar:: Lebedev, D, ve diğerleri
Baskı/Yayın Bilgisi: (2021) -
Approximate dynamic programming for revenue management in attended home delivery
Yazar:: Lebedev, D
Baskı/Yayın Bilgisi: (2020) -
On the convergence of a regularized Jacobi algorithm for convex optimization
Yazar:: Banjac, G, ve diğerleri
Baskı/Yayın Bilgisi: (2017)