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...
| Hauptverfasser: | , , |
|---|---|
| Format: | Journal article |
| Sprache: | English |
| Veröffentlicht: |
IEEE
2021
|