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

Bibliografske podrobnosti
Main Authors:	Lebedev, D, Margellos, K, Goulart, P
Format:	Journal article
Jezik:	English
Izdano:	IEEE 2021

Podobne knjige/članki

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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