Random Yield and Random Demand in a Production System with Downward Substitution
Operations Research
Dynamic Pricing in Airline Seat Management for Flights with Multiple Flight Legs
Transportation Science
Revenue Management: Research Overview and Prospects
Transportation Science
Single-Period Multiproduct Inventory Models with Substitution
Operations Research
A Dynamic Airline Seat Inventory Control Model and Its Optimal Policy
Operations Research
Optimal Dynamic Pricing for Perishable Assets with Nonhomogeneous Demand
Management Science
Mathematics of Operations Research
A stochastic approach to hotel revenue optimization
Computers and Operations Research
Dynamic Pricing and the Direct-to-Customer Model in the Automotive Industry
Electronic Commerce Research
Computers and Operations Research
A Stochastic Petri Net Approach for Inventory Rationing in Multi-Echelon Supply Chains
Journal of Heuristics
A Monopolistic and Oligopolistic Stochastic Flow Revenue Management Model
Operations Research
Dynamic Pricing Strategies for Multiproduct Revenue Management Problems
Manufacturing & Service Operations Management
Manufacturing & Service Operations Management
Symbolic dynamic programming for first-order MDPs
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Planning and acting in partially observable stochastic domains
Artificial Intelligence
Computers and Industrial Engineering
Hi-index | 0.00 |
This paper examines dynamic selling (DS) problems under demand uncertainties. Quality-graded products with fully downward substitutable demands are considered. Downward demand substitution indicates that demands for lower quality grade products can be fulfilled by either designated or higher quality grade products. In this dynamic selling problem, decision makers need to choose an optimal selling policy in each decision epoch. The objective is to identify an optimal policy for the dynamic selling of quality-graded inventory. DS problems are formulated as a discrete-time Markov decision process (MDP) model. In the MDP model, demand type and inventory levels are state variables. The objective is to maximize expected profits. In such a multi-dimensional dynamic decision problem, computational complexity is a chief concern. This study proves the structure of optimal policies that significantly reduce computational complexity. Performance of optimal dynamic selling policies is evaluated in detailed numerical studies.