Adaptive ordering and pricing for perishable products

Operations Research

Volumn 48, Issue 3, 2000, Pages 436-443

  Burnetas, A N ^a   Smith, C E ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; COSTS; DECISION THEORY; PROBABILITY; PROBLEM SOLVING; PURCHASING; RANDOM PROCESSES;

ADAPTIVE ORDERING; ADAPTIVE PRICING; DEMAND DISTRIBUTION; MULTIARMED BANDIT PROBLEM; PERISHABLE PRODUCTS;

OPERATIONS RESEARCH;

EID: 0034179714     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.3.436.12437     Document Type: Article

References (24)

1. Optimal pricing and lot-sizing under conditions of perishability and partial backordering
2. Bayes solutions to dynamic inventory models under unknown demand distribution
3. Informational dynamics of censored observations
4. Optimal adaptive policies for sequential allocation problems
5. Marketing-production joint decision making
6. Stochastic quasigradient methods and their application to systems optimization
7. The distribution free newsboy problem: Review and extensions
8. Optimal dynamic pricing of inventories with stochastic demand over finite horizons
9. Sequential allocation from several populations
10. Consistency and asymptotic efficiency of slope estimates in stochastic approximation schemes
11. Asymptotically efficient adaptive allocation rules
12. Informational dynamics and new product pricing
13. Myopic policies for some inventory models with uncertain demand distributions
14. Demand estimation in lost sales inventory systems
15. Dynamic pricing and ordering decisions by a monopolist
16. Some aspects of the sequential design of experiments
17. A stochastic approximation method
18. A convergence theorem for non-negative almost supermartingales and some applications
19. A min-max solution of an inventory problem
20. Bayesian updating of an arbitrary discrete distribution under a special case of partial information
21. Robust newsboy models with budget constraints