Convexity and feedback in approximate dynamic programming for delivery time slot pricing

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...

Descripció completa

Dades bibliogràfiques
Autors principals:	Lebedev, D, Margellos, K, Goulart, P
Format:	Journal article
Idioma:	English
Publicat:	IEEE 2021

Ítems similars

A dynamic programming framework for optimal delivery time slot pricing
per: Lebedev, D, et al.
Publicat: (2020)

Gradient bounded dynamic programming with submodular and concave extensible value functions
per: Lebedev, D, et al.
Publicat: (2021)

Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees
per: Lebedev, D, et al.
Publicat: (2021)

Approximate dynamic programming for revenue management in attended home delivery
per: Lebedev, D
Publicat: (2020)

On the convergence of a regularized Jacobi algorithm for convex optimization
per: Banjac, G, et al.
Publicat: (2017)

On the exact feasibility of convex scenario programs with discarded constraints
per: Romao, L, et al.
Publicat: (2022)

Convex co-design of control barrier functions and feedback controllers for linear systems
per: Wang, H, et al.
Publicat: (2024)

A scenario approach for non-convex control design
per: Grammatico, S, et al.
Publicat: (2015)

Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints
per: Romao, L, et al.
Publicat: (2023)

The sharp doubling threshold for approximate convexity
per: van Hintum, P, et al.
Publicat: (2024)

Proximal minimization based distributed convex optimization
per: Margellos, K, et al.
Publicat: (2016)

Approximation of convex functions by convex splines and convexity preserving continuous linear operators
per: R. Bojanic, et al.
Publicat: (1974-08-01)

Approximation of convex functions by convex splines and convexity preserving continuous linear operators
per: R. Bojanic, et al.
Publicat: (1974-08-01)

Regularized Jacobi iteration for decentralized convex quadratic optimization with separable constraints
per: Deori, L, et al.
Publicat: (2018)

Probably approximately correct Nash equilibrium learning
per: Fele, F, et al.
Publicat: (2020)

Applying the genetic algorithm and the consequential convex approximation programming for composite structure optimization
per: Nguyen Thoi Trung, et al.
Publicat: (2004-12-01)

Theoretical approximations for a slot antenna resonance.
per: Rogers, Alan E.E.
Publicat: (2024)

Approximate Convexity for Set-Valued Maps
per: Zohreh Kefayati, et al.
Publicat: (2023-12-01)

Slot Games for Detecting Timing Leaks of Programs
per: Aleksandar S. Dimovski
Publicat: (2013-07-01)

State aggregation for distributed value iteration in dynamic programming
per: Vertovec, N, et al.
Publicat: (2023)

Distributed constrained convex optimization and consensus via dual decomposition and proximal minimization
per: Falsone, A, et al.
Publicat: (2016)

Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints
per: Abay Molla Kassa, et al.
Publicat: (2014-07-01)

Implications between approximate convexity properties and approximate Hermite-Hadamard inequalities
per: Makó Judit, et al.
Publicat: (2012-06-01)

Efficient semidefinite programming with approximate ADMM
per: Rontsis, N, et al.
Publicat: (2021)

An Approximate Analytical Method for a Slot Ring Radome
per: Kang Luo, et al.
Publicat: (2023-11-01)

A Unifying Polyhedral Approximation Framework for Convex Optimization
per: Bertsekas, Dimitri P., et al.
Publicat: (2011)

Joint slot allocation and dynamic pricing of container sea–rail multimodal transportation
per: Di Liu, et al.
Publicat: (2015-06-01)

Linear Program-Based Approximation for Personalized Reserve Prices
per: Derakhshan, Mahsa, et al.
Publicat: (2022)

Polyhedral approximation in mixed-integer convex optimization
per: Yamangil, Emre, et al.
Publicat: (2018)

Analysis II: convex analysis and approximation theory /
per: Gamkrelidze, R. V.
Publicat: (1990)

Convexity, Markov Operators, Approximation, and Related Optimization
per: Octav Olteanu
Publicat: (2022-08-01)

Induced convexity and the problem of the induced best approximation
per: Liana Lupşa, et al.
Publicat: (2001-02-01)

Induced convexity and the problem of the induced best approximation
per: Liana Lupşa, et al.
Publicat: (2001-02-01)

Congestion Pricing for Aircraft Pushback Slot Allocation.
per: Lihua Liu, et al.
Publicat: (2017-01-01)

Convergence of distributed approximate subgradient method for minimizing convex function with convex functional constraints
per: Jedsadapong Pioon, et al.
Publicat: (2024-06-01)

Pricing ad slots with consecutive multi-unit demand
per: Deng, X, et al.
Publicat: (2016)

Bond price sensitivity, duration and convexity
per: , ARDIYANTO, Dimas, et al.
Publicat: (2004)

Convex Programming and Bootstrap Sensitivity for Optimized Electricity Bill in Healthcare Buildings under a Time-Of-Use Pricing Scheme
per: Rodolfo Gordillo-Orquera, et al.
Publicat: (2018-06-01)

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
per: Halman, Nir, et al.
Publicat: (2017)

On decentralized convex optimization in a multi-agent setting with separable constraints and its application to optimal charging of electric vehicles
per: Deori, L, et al.
Publicat: (2016)