2016
DOI: 10.1111/poms.12504
|View full text |Cite
|
Sign up to set email alerts
|

Joint Inventory and Pricing Coordination with Incomplete Demand Information

Abstract: In retailing operations, retailers face the challenge of incomplete demand information. We develop a new concept named K‐approximate convexity, which is shown to be a generalization of K‐convexity, to address this challenge. This idea is applied to obtain a base‐stock list‐price policy for the joint inventory and pricing control problem with incomplete demand information and even non‐concave revenue function. A worst‐case performance bound of the policy is established. In a numerical study where demand is driv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
1

Year Published

2018
2018
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 16 publications
(28 citation statements)
references
References 28 publications
0
26
1
Order By: Relevance
“…Remark As K ‐approximation convexity can be preserved by expectation (proposition 1 in Lu et al. ), Theorem also holds for the CTGEA approach.…”
Section: Optimality Analysis and Heuristic Policiesmentioning
confidence: 91%
See 2 more Smart Citations
“…Remark As K ‐approximation convexity can be preserved by expectation (proposition 1 in Lu et al. ), Theorem also holds for the CTGEA approach.…”
Section: Optimality Analysis and Heuristic Policiesmentioning
confidence: 91%
“…In Step 3, we extend the convex envelope of W(x) from the domain (x 1 , x mÀ1 ) to the domain (À∞, +∞). Lu et al (2016) proposed a linear programming formulation to obtain the convex approximation of a continuous piecewise linear function W(x). However, the cost function defined by Equation (1) in this study may not be continuous, in which case it cannot be approximated by solving the linear programming formulation but can be approximated by using Algorithm 1.…”
Section: Algorithm 1 Obtain a Convex Approximationmentioning
confidence: 99%
See 1 more Smart Citation
“…Lu and Song [15] characterized the optimal policies for single-period and multi-period inventory systems, respectively, where the production cost includes a fixed cost and a piecewise linear convex variable cost. Lu et al [16] put forward a new approach called K-approximate convexity to study the multi-period joint pricing and inventory control problem with incomplete demand information and a nonconcave revenue function. Feinberg and Liang [9] explored the structure of the optimal inventory policies for a multi-period inventory control system with fixed ordering costs and all possible values of discount factor under both finite and infinite horizons.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Aydin and Porteus (2008) considered the model similar to Dada and Petruzzi's (1999) with an additional scope to include multiple products in a given assortment, under price-based substitution. Lu et al (2016) developed the K-approximate convexity, to solve this inventory-pricing coordination problems and to provide well-structured heuristic policies.…”
Section: Introduction and Literature Reviewmentioning
confidence: 99%