Model predictive control for dynamic resource allocation

Mathematics of Operations Research

Volumn 37, Issue 3, 2012, Pages 501-525

  Ciocan, Dragos Florin ^a   Farias, Vivek ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Model predictive control; Online advertising; Stochastic control

Indexed keywords

COMPUTATIONAL EXPERIMENT; DYNAMIC ALLOCATIONS; DYNAMIC RESOURCE ALLOCATIONS; FORECAST UPDATES; ON-LINE FASHION; ONLINE ADVERTISING; POTENTIAL APPLICATIONS; REAL-WORLD PROBLEM; REOPTIMIZATION; REVENUE MANAGEMENT; STOCHASTIC CONTROL;

APPROXIMATION ALGORITHMS; EXPERIMENTS; MODEL PREDICTIVE CONTROL;

PREDICTIVE CONTROL SYSTEMS;

EID: 84866705481     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1120.0548     Document Type: Article

References (24)

1. Adelman D (2007) Dynamic bid price in revenue management. Oper. Res. 55(4):647-661.
2. Agrawal S, Wang Z, Ye Y (2009) A dynamic near-optimal algorithm for online linear programming. CoRR abs/0911.2974.
3. Akan M, Ata B (2009) Bid-price controls for network revenue management: Martingale characterization of optimal bid prices. Math. Oper. Res. 34(4):912-936.
4. Ball MO, Queyranne M (2009) Toward robust revenue management: Competitive analysis of online booking. Oper. Res. 57(4):950-963.
5. Bemporad A (2006) Model-based predictive control design: New trends and tools. CDC06: 45th Conf. Decision and Control, San Diego (IEEE, New York), 6678-6683.
6. Bertsekas DP, Shreve SE (2007) Stochastic Optimal Control: The Discrete-Time Case (Athena Scientific, Nashua, NH).
7. Bertsimas D, Demir R (2002) An approximate dynamic programming approach to multidimensional knapsack problems. Management Sci. 48:550-565.
8. Besbes O, Maglaras C (2009) Revenue optimization for a make-to-order queue in an uncertain market environment. Oper. Res. 57(6):1438-1450.
9. Bramson M (1998) State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems 30:89-148.
10. Buchbinder N, Naor J (2009) Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34:270-286.
11. Chen H, Yao DD (1993) Dynamic scheduling of a multiclass fluid network. Oper. Res. 41:1104-1115.
12. Chen Y, Farias VF (2010) Simple Policies for Dynamic Pricing with Imperfect Forecasts. Preprint.
13. Farias VF, Van Roy B (2007) An Approximate Dynamic Programming Approach to Network Revenue Management. Preprint.
14. Farias VF, Van Roy B (2010) Dynamic pricing with a prior on market response. Oper. Res. 58(1):16-29.
15. Gallego G, van Ryzin G (1997) A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. 45(1):24-41.
16. Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313-345.
17. Karatzas I, Shreve SE (1991) Brownian Motion and Stochastic Calculus (Springer, New York).
18. Kleinberg R (2005) A multiple-choice secretary algorithm with applications to online auctions. Proc. Sixteenth Annual ACM-SIAM Sympos. Discrete Algorithms. SODA '05 (Society for Industrial and Applied Mathematics, Philadelphia), 630-631.
19. Maglaras C, Meissner J (2006) Dynamic pricing strategies for multiproduct revenue management problems. Manufacturing Service Oper. Management 8(2):136-148.
20. Mahdian M, Nazerzadeh H, Saberi A (2012) Online optimization with uncertain information. ACM Trans. Algorithms 8(1):2.
21. Mehta A, Saberi A, Vazirani U, Vazirani V (2005) Adwords and generalized on-line matching. FOCS'05: Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE Computer Society Press, Los Alamitos, CA), 264-273.
22. Reiman MI, Wang Q (2008) An asymptotically optimal policy for a quantity-based network revenue management problem. Math. Oper. Res. 33(2):257-282.
23. Shah D, Wischik D (2011) Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. Forthcoming.
24. Zhang D, Adelman D (2009) An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. 43(3):381-394.