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

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों:	Lebedev, D, Margellos, K, Goulart, P
स्वरूप:	Journal article
भाषा:	English
प्रकाशित:	IEEE 2021

समान संसाधन

A dynamic programming framework for optimal delivery time slot pricing
द्वारा: Lebedev, D, और अन्य
प्रकाशित: (2020)

Gradient bounded dynamic programming with submodular and concave extensible value functions
द्वारा: Lebedev, D, और अन्य
प्रकाशित: (2021)

Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees
द्वारा: Lebedev, D, और अन्य
प्रकाशित: (2021)

Approximate dynamic programming for revenue management in attended home delivery
द्वारा: Lebedev, D
प्रकाशित: (2020)

On the convergence of a regularized Jacobi algorithm for convex optimization
द्वारा: Banjac, G, और अन्य
प्रकाशित: (2017)

On the exact feasibility of convex scenario programs with discarded constraints
द्वारा: Romao, L, और अन्य
प्रकाशित: (2022)

Convex co-design of control barrier functions and feedback controllers for linear systems
द्वारा: Wang, H, और अन्य
प्रकाशित: (2024)

A scenario approach for non-convex control design
द्वारा: Grammatico, S, और अन्य
प्रकाशित: (2015)

Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints
द्वारा: Romao, L, और अन्य
प्रकाशित: (2023)

The sharp doubling threshold for approximate convexity
द्वारा: van Hintum, P, और अन्य
प्रकाशित: (2024)

Approximation of convex functions by convex splines and convexity preserving continuous linear operators
द्वारा: R. Bojanic, और अन्य
प्रकाशित: (1974-08-01)

Approximation of convex functions by convex splines and convexity preserving continuous linear operators
द्वारा: R. Bojanic, और अन्य
प्रकाशित: (1974-08-01)

Proximal minimization based distributed convex optimization
द्वारा: Margellos, K, और अन्य
प्रकाशित: (2016)

Regularized Jacobi iteration for decentralized convex quadratic optimization with separable constraints
द्वारा: Deori, L, और अन्य
प्रकाशित: (2018)

Theoretical approximations for a slot antenna resonance.
द्वारा: Rogers, Alan E.E.
प्रकाशित: (2024)

Applying the genetic algorithm and the consequential convex approximation programming for composite structure optimization
द्वारा: Nguyen Thoi Trung, और अन्य
प्रकाशित: (2004-12-01)

Slot Games for Detecting Timing Leaks of Programs
द्वारा: Aleksandar S. Dimovski
प्रकाशित: (2013-07-01)

Probably approximately correct Nash equilibrium learning
द्वारा: Fele, F, और अन्य
प्रकाशित: (2020)

Approximate Convexity for Set-Valued Maps
द्वारा: Zohreh Kefayati, और अन्य
प्रकाशित: (2023-12-01)

State aggregation for distributed value iteration in dynamic programming
द्वारा: Vertovec, N, और अन्य
प्रकाशित: (2023)

Distributed constrained convex optimization and consensus via dual decomposition and proximal minimization
द्वारा: Falsone, A, और अन्य
प्रकाशित: (2016)

Efficient semidefinite programming with approximate ADMM
द्वारा: Rontsis, N, और अन्य
प्रकाशित: (2021)

Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints
द्वारा: Abay Molla Kassa, और अन्य
प्रकाशित: (2014-07-01)

Implications between approximate convexity properties and approximate Hermite-Hadamard inequalities
द्वारा: Makó Judit, और अन्य
प्रकाशित: (2012-06-01)

An Approximate Analytical Method for a Slot Ring Radome
द्वारा: Kang Luo, और अन्य
प्रकाशित: (2023-11-01)

Joint slot allocation and dynamic pricing of container sea–rail multimodal transportation
द्वारा: Di Liu, और अन्य
प्रकाशित: (2015-06-01)

A Unifying Polyhedral Approximation Framework for Convex Optimization
द्वारा: Bertsekas, Dimitri P., और अन्य
प्रकाशित: (2011)

Linear Program-Based Approximation for Personalized Reserve Prices
द्वारा: Derakhshan, Mahsa, और अन्य
प्रकाशित: (2022)

Polyhedral approximation in mixed-integer convex optimization
द्वारा: Yamangil, Emre, और अन्य
प्रकाशित: (2018)

Analysis II: convex analysis and approximation theory /
द्वारा: Gamkrelidze, R. V.
प्रकाशित: (1990)

Convexity, Markov Operators, Approximation, and Related Optimization
द्वारा: Octav Olteanu
प्रकाशित: (2022-08-01)

Induced convexity and the problem of the induced best approximation
द्वारा: Liana Lupşa, और अन्य
प्रकाशित: (2001-02-01)

Induced convexity and the problem of the induced best approximation
द्वारा: Liana Lupşa, और अन्य
प्रकाशित: (2001-02-01)

Congestion Pricing for Aircraft Pushback Slot Allocation.
द्वारा: Lihua Liu, और अन्य
प्रकाशित: (2017-01-01)

Pricing ad slots with consecutive multi-unit demand
द्वारा: Deng, X, और अन्य
प्रकाशित: (2016)

Convergence of distributed approximate subgradient method for minimizing convex function with convex functional constraints
द्वारा: Jedsadapong Pioon, और अन्य
प्रकाशित: (2024-06-01)

Bond price sensitivity, duration and convexity
द्वारा: , ARDIYANTO, Dimas, और अन्य
प्रकाशित: (2004)

Convex Programming and Bootstrap Sensitivity for Optimized Electricity Bill in Healthcare Buildings under a Time-Of-Use Pricing Scheme
द्वारा: Rodolfo Gordillo-Orquera, और अन्य
प्रकाशित: (2018-06-01)

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
द्वारा: Halman, Nir, और अन्य
प्रकाशित: (2017)

Outer approximation with conic certificates for mixed-integer convex problems
द्वारा: Coey, Chris, और अन्य
प्रकाशित: (2021)