Coordinating Inventory Control and Pricing Strategies Under Batch Ordering

Yi Yang (), Youhua (Frank) Chen () and Yun Zhou ()
Additional contact information
Yi Yang: Department of Management Science and Engineering, Zhejiang University, Hangzhou, China, 310014
Youhua (Frank) Chen: Department of Management Sciences, City University of Hong Kong, Kowloon Tong, Hong Kong
Yun Zhou: Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada

Operations Research, 2014, vol. 62, issue 1, 25-37

Abstract: In this paper we investigate joint pricing and inventory control problems in a finite-horizon, single-product, periodic-review setting with certain/uncertain supply capacities. The demands in different periods are random variables whose distributions depend on the posted price exhibiting the additive form. The order quantity in each period is required to be of integral multiples of a given specific batch size (denoted by Q ). Inventory replenishment incurs a linear ordering cost. Referred to as the cost-rate function, the sum of holding and backorder costs can either be convex or quasi-convex. The objective is to determine a joint ordering and pricing decision that can maximize the total expected profit over the planning horizon.We first consider the case in which the cost-rate function is convex and show that the modified ( r , Q ) list-price policy is optimal for the system with certain and limited capacities, a special case of which is the ( r , Q ) list-price policy when capacities become unlimited. As supply capacities become random, the optimal policy follows a new structure wherein the optimal order-up-to level and posted price must be coordinated to make the optimal safety stock level follow the ( r , Q ) policy. We further consider the case of a quasi-convex cost-rate function, which may arise when a service level constraint is used as a surrogate for the shortage cost. We demonstrate that the ( r , Q ) list-price policy is optimal for the system without supply capacity constraints. In addition, extensions to several other models are discussed. The enabling technique is based on the notion of Q -jump convexity and its variants.

Keywords: inventory-pricing systems, supply capacity, Q-jump convexity; (r,Q) list-price policy, dynamic programming (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (74)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2013.1238 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:62:y:2014:i:1:p:25-37

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().