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

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak:	Lebedev, D, Margellos, K, Goulart, P
Formatua:	Journal article
Hizkuntza:	English
Argitaratua:	IEEE 2021

Antzeko izenburuak

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Outer approximation with conic certificates for mixed-integer convex problems
nork: Coey, Chris, et al.
Argitaratua: (2021)

Constructing Convex Inner Approximations of Steady-State Security Regions
nork: Nguyen, Hung D., et al.
Argitaratua: (2024)