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...
Príomhchruthaitheoirí: | Lebedev, D, Margellos, K, Goulart, P |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
IEEE
2021
|
Míreanna comhchosúla
Míreanna comhchosúla
-
A dynamic programming framework for optimal delivery time slot pricing
de réir: Lebedev, D, et al.
Foilsithe / Cruthaithe: (2020) -
Gradient bounded dynamic programming with submodular and concave extensible value functions
de réir: Lebedev, D, et al.
Foilsithe / Cruthaithe: (2021) -
Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees
de réir: Lebedev, D, et al.
Foilsithe / Cruthaithe: (2021) -
Approximate dynamic programming for revenue management in attended home delivery
de réir: Lebedev, D
Foilsithe / Cruthaithe: (2020) -
On the convergence of a regularized Jacobi algorithm for convex optimization
de réir: Banjac, G, et al.
Foilsithe / Cruthaithe: (2017)