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...
Main Authors: | Lebedev, D, Margellos, K, Goulart, P |
---|---|
Format: | Journal article |
Language: | English |
Published: |
IEEE
2021
|
Similar Items
-
A dynamic programming framework for optimal delivery time slot pricing
by: Lebedev, D, et al.
Published: (2020) -
Gradient bounded dynamic programming with submodular and concave extensible value functions
by: Lebedev, D, et al.
Published: (2021) -
Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees
by: Lebedev, D, et al.
Published: (2021) -
Approximate dynamic programming for revenue management in attended home delivery
by: Lebedev, D
Published: (2020) -
On the convergence of a regularized Jacobi algorithm for convex optimization
by: Banjac, G, et al.
Published: (2017)