Transcript

Research ArticleThe Distribution-Free Newsboy Problem withMultiple Discounts and Upgrades

Ilkyeong Moon,1 Dong Kyoon Yoo,2 and Subrata Saha1

1Department of Industrial Engineering, Seoul National University, Seoul 08826, Republic of Korea2Quality Management Department, LG Electronics, Seoul 07336, Republic of Korea

Correspondence should be addressed to Subrata Saha; [email protected]

Received 28 March 2016; Accepted 26 July 2016

Academic Editor: Paolo Crippa

Copyright Β© 2016 Ilkyeong Moon et al.This is an open access article distributed under the Creative Commons Attribution License,which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Most papers on the newsboy problem assume that excess inventory is either sold after discount or discarded. In the real world,overstocks are handled with multiple discounts, upgrades, or a combination of these measures. For example, a seller may offer aseries of progressively increasing discounts for units that remain on the shelf, or the sellermay use incrementally applied innovationsaimed at stimulating greater product sophistication. Moreover, the normal distribution does not provide better protection thanother distributions with the samemean and variance. In this paper, we find the differences between normal distribution approachesand distribution-free approaches in four scenarios withmean and variance of demand as the only available data to decision-makers.First, we solve the newsboy problem by considering multiple discounts. Second, we formulate and solve the newsboy problem byconsidering multiple upgrades. Third, we formulate and solve a mixed newsboy problem characterized with multiple discountsand upgrades. Finally, we extend the model to solve a multiproduct newsboy problem with a storage or a budget constraint anddevelop an algorithm to find the solutions of the models. Concavity of the models is proved analytically. Extensive computationalexperiments are presented to verify the robustness of the distribution-free approach. The results show that the distribution-freeapproach is robust.

1. Introduction

In general selling situations, the information on demanddistribution is limited. Often, sellers are only provided withan educated guess of the mean and the variance. Then, theywill use the normal distribution of the demand to determinethe proper inventory levels. However, the normal distributionfor demand does not provide the best protection for theoccurrence of other distributions with the same mean andthe same variance. In a classic paper, Scarf [1] addressed thenewsboy problem in which the mean πœ‡ and the variance 𝜎

2

of demand were given, whereas assumptions on the distri-bution of demand were not available. Taking a conservativeapproach, Scarf modeled the problem by finding the orderquantity that maximizes the expected profit and comparedthe result with the worst possible distribution of demand ascharacterizedwith themean πœ‡ and the variance𝜎

2.Through abeautiful, but lengthy, mathematical argument, Scarf showedthat the worst demand distribution is positive at two points

and developed the min-max distribution-free approach as aclosed-form expression for deriving the optimal order quan-tity.

Gallego and Moon [2] simplified the proof of Scarf ’s [1]ordering rule for the newsboy problem.Moon andGallego [3]applied the approach to several inventory models includinga periodic review model. Moon and Choi [4] solved thedistribution-free continuous-review inventory model witha service-level constraint. Moon and Choi [5] providedthe make-to-order and make-in-advance models using thedistribution-free procedure. Moon and Choi [6] improvedthe continuous-review inventory model by simultaneouslyoptimizing the order quantity and reorder point. Ouyang andWu [7] developed models for reduction of the continuous-review inventory system. They also applied the distribution-free approach to each model and proved its robustness.Hariga and Ben-Daya [8] developed optimal reduction pro-cedures in the procurement lead time duration and appliedthe distribution-free approach to several stochastic inventory

Hindawi Publishing CorporationMathematical Problems in EngineeringVolume 2016, Article ID 2017253, 11 pageshttp://dx.doi.org/10.1155/2016/2017253

2 Mathematical Problems in Engineering

models such as the continuous- and periodic-review modelswith amixture of backorders and lost sales and the base stock.Ouyang and Chang [9] applied a minimax distribution-freeprocedure for mixed inventory models with variable leadtime and fuzzy lost sales. Tajbakhsh [10] derived closed-form expressions for the model of Moon and Choi [4].Numerous models have been studied using the distribution-free approach [11–16]. For more details, one can refer to anextensive review of the literature provided by Qin et al. [17].In this study, we verify the robustness of the distribution-freeapproach where multiple discounts or upgrades are used tosell products and study the impact of the distribution-freeapproach under a storage or a budget constraint.

The classical newsboy problem is designed to find theproduct order quantity that maximizes the expected profitin a single-period, probabilistic demand framework. Hadleyand Whitin [18] addressed the newsboy model under theassumption that an excess inventory from an order quantitylarger than the realized demand is either sold with a singlediscount or discarded. Following the work, various versionsof pricing and discount strategies have been discussed toexplore the characteristics of the newsboy problem. Readerscan refer to some major research performances by Carrizosaet al. [19], Li et al. [20], and Ye and Sun [21]. Recently, Petruzziand Dada [22] addressed a comprehensive review and mean-ingful extensions for the pricing decision in the newsboyproblem. However, multiple progressive discounts in a news-boy framework have received only minor attention despitetheir common appearances in apparel industry where dis-counts get steeper as the season draws to an end [23]. Khouja[24] developed a model in which multiple discounts areused progressively to sell excess inventory with normally dis-tributed demand. Later, Khouja and Mehrez [25] consideredan extension in which a space or budget constraint is placedon a group of items. Khouja [26] extended the newsboyproblem by considering price-dependent demand and mul-tiple discounts to sell excess inventory. Such extensions havebeen thoroughly studied for deterministic economic-orderquantity models. In this paper, we apply the distribution-freeapproach to the basic model of Khouja [24] and consider thesituation in which more than one type of stock-keeping unitis stocked for a single-period demand.

Considerable research has been conducted to analyze themultiproduct newsboy problemswith constraints [18, 27–29].Among those works, Hadley andWhitin [18] were the first toconsider a single constraint to a multiproduct newsboy prob-lem. Nahmias and Schmidt [30] proposed a multiproductnewsboy problem with stochastic demand subject to linearand deterministic constraints on space or budget. H.-S. Lauand A. H.-L. Lau [31] extended the constrained newsboyproblem to general demand distributions. Erlebacher [32]developed optimal and heuristic solutions for the capacitatednewsboy problem. Although budget and storage constraintsas well as price discounts are common features in numerousproblems, few researchers have considered both a constraintand a discount in a newsboy model. In this paper, weextend the multiproduct newsboy problem to the situationin which the newsboy problem is characterized by a budgetconstraint andmultiple discounts to stimulate demand under

the traditional and distribution-free approaches and considerthe cost of improving the quality of the product. Nonpricecompetition is found in many industries, and, as a keynonprice competitive feature in the majority of industries,improved product quality has received intensive attention,especially in terms of investment [33]. Quality upgradingimproves firm’s ability to serve more consumers becausequality products appeal to wealthier consumers. We refer thereader to Garvin [34] for an excellent summary of qualitycharacterization. Also, since 1970, Toyota Motor Co. Ltd.began cooperating with its supplier to improve product qual-ity [35]. In an increasingly competitive global environment,there is growing evidence that investment in quality improve-ments, such as applying, renewing, updating, accumulating,and redeeming, enhances customer satisfaction and buildslong-term relationships between sellers and customers [36].However, most of the studies on quality improvement fallunder the supply chain framework [37, 38]. Due to theseextensions we make, our model is applicable not only to theapparel industry, but also to the computer, telecommunica-tion machine, college textbooks, and video game industriesamong others. In each case, we are not able to estimate theexact price because an upgrade cost may be incurred due togrowing technology. However, one must note that upgradecost does not necessarily translate into increased demand.Therefore, we keep the price fixed and formulate the problemwith multiple upgrades. To the best of our knowledge, thistype of quality improvement strategy has received little atten-tion in studies of the newsboy problem. Moreover, we con-sider the effect of both multiple discounts and upgrades onprofitability.

In this study, we extend the newsboy problem to considerthe situation in which the seller applies progressive multiplediscounts, upgrades, or their combination, to enhance prod-uct flow and profit.We elongate the newsboy problemby con-sidering four different scenarios and compare the effects ofthe distribution-free approach with the traditional distribu-tion approach in single- andmultiple-product environments.We also examine the effect of a budget or a storage constraint.The remainder of the paper is organized as follows. Section 2analyzes the behavior of newsboy problems for demand dis-tribution of a single product in three different scenarios. Wepresent the theoretical background for obtaining the orderquantities under the worst- and best-case scenarios. Section 3discusses the newsboy problem with progressive multiplediscounts or upgrades under a budget or a storage constraint.Section 4 presents computational examples to illustrate all themodels. Finally, Section 5 addresses final remarks as well assuggestions for future research and extensions of the obtainedresults.

2. Mathematical Models

The following notations are used to establish mathematicalmodels:

𝑗: the discounted (or upgraded) index.𝑛: the number of discounts (or upgrades).𝑃: the unit selling price.

Mathematical Problems in Engineering 3

𝐢: the unit cost.

𝑆: the salvage value.

𝑋: the quantity demanded, a random variable (𝑋 >

0).

𝑓(𝑋): the probability density function of 𝑋.

𝐹(𝑋): the cumulative distribution function of 𝑋.

𝑄: the order quantity.

πœ‡: the expected demand.

𝜎: the standard deviation of demand.

𝑑𝑗: the 𝑗th discounted rate (0 ≀ 𝑑

𝑗≀ 1), 0 = 𝑑

0<

𝑑1< 𝑑2< β‹… β‹… β‹… < 𝑑

𝑛.

𝑃𝑗: the 𝑗th discounted selling price, 𝑃

𝑗= (1 βˆ’ 𝑑

𝑗)𝑃.

𝑒𝑗: the 𝑗th upgraded rate (0 ≀ 𝑒

𝑗≀ 1), 0 = 𝑒

0< 𝑒1<

𝑒2< β‹… β‹… β‹… < 𝑒

𝑛.

𝐢𝑗: the 𝑗th upgraded cost, 𝐢

𝑗= (1 + 𝑒

𝑗)𝐢.

𝑑𝑗: the fraction of the realized demand at the original

price (or cost) that can additionally be sold bydiscounting (or upgrading) the product to price𝑃

𝑗(or

cost 𝐢𝑗) (0 < 𝑑

𝑗< 1).

2.1.TheNewsboy Problemwith ProgressiveMultiple Discounts.We focus on the special case where the additional quantitythat can be sold at the 𝑗th discount price is directly propor-tional to the quantity realized at the regular price. In otherwords, if the product has high demand at the regular price,then discounting the product should result in proportionallyadditional demand and vice versa. If we refer to the time ofthe 𝑗th discount as the 𝑗th discount period, then statisticallythe demand in each discount period is perfectly andpositivelycorrelated with the demand in the first (nondiscount) period.We assume that the salvage value of the product is the 𝑛thdiscount price, and the penalty for not satisfying demand is

zero. Here, the profit function (πœ‹π‘π‘‘(𝑄)) can be represented as

follows:

πœ‹π‘

𝑑(𝑄)

=

{{{{{{{{{{{{{{{{{

{{{{{{{{{{{{{{{{{

{

𝛼0𝑑0𝑄 if Q

𝑉0

≀ 𝑋

𝛼0𝑑0𝑋 + 𝛼

1(𝑄 βˆ’ 𝑉

0𝑋) if 𝑄

𝑉1

≀ 𝑋 <𝑄

𝑉0

𝛼0𝑑0𝑋 + 𝛼

1𝑑1𝑋 + 𝛼

2(𝑄 βˆ’ 𝑉

1𝑋) if 𝑄

𝑉2

≀ 𝑋 <𝑄

𝑉1

.

.

....

𝑋

π‘›βˆ’1

βˆ‘

𝑗=0

𝛼𝑗𝑑𝑗+ 𝛼𝑛(𝑄 βˆ’ 𝑉

π‘›βˆ’1𝑋) if 0 ≀ 𝑋 <

𝑄

π‘‰π‘›βˆ’1

,

(1)

where 𝛼𝑗= π‘ƒπ‘—βˆ’ 𝐢, 𝑉

𝑗= 1 + βˆ‘

𝑗

π‘˜=1π‘‘π‘˜, 𝑑0= 1, and 𝑉

0= 1. The

expected value of πœ‹π‘π‘‘(𝑄) is

Π𝑁

𝑑(𝑄)

= ∫

∞

𝑄/𝑉0

𝛼0𝑑0𝑄𝑓 (𝑋) 𝑑𝑋

+ ∫

𝑄/𝑉0

𝑄/𝑉1

[𝛼0𝑑0𝑋 + 𝛼

1(𝑄 βˆ’ 𝑉

0𝑋)]𝑓 (𝑋) 𝑑𝑋 + β‹… β‹… β‹…

+ ∫

𝑄/π‘‰π‘›βˆ’1

0

[

[

𝑋

π‘›βˆ’1

βˆ‘

𝑗=0

𝛼𝑗𝑑𝑗+ 𝛼𝑛(𝑄 βˆ’ 𝑉

π‘›βˆ’1𝑋)]

]

𝑓 (𝑋) 𝑑𝑋.

(2)

The necessary condition for 𝑄 to be optimal is given by

𝑑Π𝑁

𝑑(𝑄)

𝑑𝑄= 𝛼0βˆ’

π‘›βˆ’1

βˆ‘

𝑗=0

(π‘ƒπ‘—βˆ’ 𝑃𝑗+1

) 𝐹(𝑄

𝑉𝑗

) = 0. (3)

The second-order derivative of Π𝑁

𝑑(𝑄) is given by

𝑑2Π𝑁

𝑑(𝑄)/𝑑𝑄

2= βˆ‘π‘›βˆ’1

𝑗=0(1/𝑉𝑗)(𝑃𝑗+1

βˆ’ 𝑃𝑗)𝑓(𝑄/𝑉

𝑗). Because

𝑓(𝑋) β‰₯ 0 and 𝑃𝑗+1

βˆ’ 𝑃𝑗

≀ 0, 𝑑2Π𝑁𝑑(𝑄)/𝑑𝑄

2≀ 0 for 𝑄 β‰₯ 0

and hence Π𝑁

𝑑(𝑄) is concave.

The normal distribution does not provide the best pro-tection against the occurrence of other distributions withthe same mean and variance. Therefore, we formulate andsolve the distribution-free newsboy problem with multiplediscounts. In this case, the profit function (πœ‹π‘Š

𝑑(𝑄)) can be

obtained as

πœ‹π‘Š

𝑑(𝑄) =

{{{{{{{{{{{{{{{

{{{{{{{{{{{{{{{

{

𝛼0𝑑0𝑄 if 𝑄

𝑉0

≀ 𝑋

𝛼0𝑑0𝑄 βˆ’ 𝑑

1𝑃 (𝑄 βˆ’ 𝑉

0𝑋) if 𝑄

𝑉1

≀ 𝑋 <𝑄

𝑉0

𝛼0𝑑0𝑄 βˆ’ 𝑑

1𝑃 (𝑄 βˆ’ 𝑉

0𝑋) βˆ’ (𝑑

2βˆ’ 𝑑1) 𝑃 (𝑄 βˆ’ 𝑉

1𝑋) if 𝑄

𝑉2

≀ 𝑋 <𝑄

𝑉1

.

.

....

𝛼0𝑑0𝑄 βˆ’ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) (𝑄 βˆ’ π‘‰π‘—βˆ’1

𝑋) if 0 ≀𝑄

π‘‰π‘›βˆ’1

.

(4)

4 Mathematical Problems in Engineering

The expected value of πœ‹π‘Šπ‘‘

(𝑄) is given by

Ξ π‘Š

𝑑(𝑄) = 𝛼

0𝑑0𝑄 βˆ’ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) 𝐸 (𝑄 βˆ’ π‘‰π‘—βˆ’1

𝑋)+

= 𝛼0𝑑0𝑄

βˆ’ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)π‘‰π‘—βˆ’1

𝐸(𝑄

π‘‰π‘—βˆ’1

βˆ’ 𝑋)

+

.

(5)

Observing that (𝑄 βˆ’ 𝑋)+

= (𝑄 βˆ’ 𝑋) + (𝑋 βˆ’ 𝑄)+, we can write

the expected profit as

Ξ π‘Š

𝑑(𝑄) = πœ‡π‘ƒ

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)π‘‰π‘—βˆ’1

βˆ’ [

[

𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) βˆ’ 𝛼0𝑑0]

]

𝑄

βˆ’ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)π‘‰π‘—βˆ’1

𝐸(𝑋 βˆ’π‘„

π‘‰π‘—βˆ’1

)

+

.

(6)

Because maximizing Ξ π‘Š

𝑑(𝑄) is equivalent to minimizing

πΆπ‘Š

𝑑(𝑄), we concentrate on minimizing 𝐢

π‘Š

𝑑(𝑄), where

πΆπ‘Š

𝑑(𝑄) = [

[

𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) βˆ’ 𝛼0𝑑0]

]

𝑄

+ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)π‘‰π‘—βˆ’1

𝐸(𝑋 βˆ’π‘„

π‘‰π‘—βˆ’1

)

+

.

(7)

Here, βˆ‘π‘›π‘—=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) = 𝑑𝑛. Because the distribution 𝐹 of 𝑋

is unknown, we want to minimize πΆπ‘Š

𝑑(𝑄) against the worst

possible distribution. For this, we need to use the followinglemma as in Gallego and Moon [2].

Lemma 1. For any 𝐹 ∈ F,

𝐸 [π‘₯ βˆ’ 𝑄]+

=1

2{[𝜎2+ (𝑄 βˆ’ πœ‡)

2

]1/2

βˆ’ (𝑄 βˆ’ πœ‡)} . (8)

Moreover, the upper bound is tight.

Using Lemma 1, our problem now reduces to minimizingthe upper bound

πΆπ‘Š

𝑑(𝑄) = (𝑃𝑑

π‘›βˆ’ 𝛼0𝑑0) 𝑄 +

𝑃

2

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)

β‹… π‘‰π‘—βˆ’1

{

{

{

[𝜎2+ (

𝑄

π‘‰π‘—βˆ’1

βˆ’ πœ‡)

2

]

1/2

βˆ’ (𝑄

π‘‰π‘—βˆ’1

βˆ’ πœ‡)}

}

}

.

(9)

The necessary condition for 𝑄 to be optimal is

π‘‘πΆπ‘Š

𝑑(𝑄)

𝑑𝑄

=1

2π‘ƒπ‘‘π‘›βˆ’ 𝛼0𝑑0

+1

2

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)(𝑄/π‘‰π‘—βˆ’1

βˆ’ πœ‡)

[𝜎2 + (𝑄/π‘‰π‘—βˆ’1

βˆ’ πœ‡)2

]

1/2

= 0.

(10)

On simplification,

2 βˆ’2𝐢

π‘ƒβˆ’ 𝑑𝑛

=

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)(𝑄/π‘‰π‘—βˆ’1

βˆ’ πœ‡)

[𝜎2 + (𝑄/π‘‰π‘—βˆ’1

βˆ’ πœ‡)2

]

1/2.

(11)

The second-order derivative of πΆπ‘Šπ‘‘(𝑄) is given by 𝑑

2πΆπ‘Š

𝑑(𝑄)/

𝑑𝑄2

= π‘ƒβˆ‘π‘›

𝑗=1((π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)𝜎2/π‘‰π‘—βˆ’1

[𝜎2+ (𝑄/𝑉

π‘—βˆ’1βˆ’ πœ‡)2]3/2

).

Because π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

β‰₯ 0, 𝑑2πΆπ‘Šπ‘‘(𝑄)/𝑑𝑄

2β‰₯ 0 for 𝑄 β‰₯ 0 and

hence πΆπ‘Š

𝑑(𝑄) is convex. Therefore, Ξ π‘Š

𝑑(𝑄) is concave.

2.2.The Newsboy Problem with ProgressiveMultiple Upgrades.We focus on the special case where the additional qualityupgraded is directly proportional to the realized demand forthe initial product. In other words, if the product has highdemand at the regular price, then upgrading the productshould result in proportionally additional demand and viceversa. If we refer to the time of the 𝑗th upgrade as the 𝑗thupgrade period, then statistically the demand in each upgradeperiod is perfectly and positively correlated with the demandin the first period. We assume that the salvage cost of theproduct is the 𝑛th upgrade cost. Here, we maximize theexpected profit to compare the normal with the worst-casedemand distribution.The profit function (πœ‹

𝑁

𝑒(𝑄)) in this case

can be written as

πœ‹π‘

𝑒(𝑄)

=

{{{{{{{{{{{{{{{{{{

{{{{{{{{{{{{{{{{{{

{

𝛼0𝑑0𝑄 if 𝑄

𝑉0

≀ 𝑋

𝛼0𝑑0𝑋 + 𝛼

1(𝑄 βˆ’ 𝑉

0𝑋) if 𝑄

𝑉1

≀ 𝑋 <𝑄

𝑉0

𝛼0𝑑0𝑋 + 𝛼

1𝑑1𝑋 + 𝛼

2(𝑄 βˆ’ 𝑉

1𝑋) if 𝑄

𝑉2

≀ 𝑋 <𝑄

𝑉1

.

.

....

𝑋

π‘›βˆ’1

βˆ‘

𝑗=0

𝛼𝑗𝑑𝑗+ 𝛼𝑛(𝑄 βˆ’ 𝑉

π‘›βˆ’1𝑋) if 0 ≀ 𝑋 <

𝑄

π‘‰π‘›βˆ’1

,

(12)

Mathematical Problems in Engineering 5

where 𝛼𝑗= 𝑃 βˆ’ 𝐢

𝑗, 𝑉𝑗= 1 + βˆ‘

𝑗

π‘˜=1π‘‘π‘˜, 𝑑0= 1, and 𝑉

0= 1. The

expected value of πœ‹π‘π‘’(𝑄) is

Π𝑁

𝑒(𝑄) = ∫

∞

𝑄/𝑉0

𝛼0𝑑0𝑄𝑓 (𝑋) 𝑑𝑋

+ ∫

𝑄/𝑉0

𝑄/𝑉1

[𝛼0𝑑0𝑋 + 𝛼

1(𝑄 βˆ’ 𝑉

0𝑋)]𝑓 (𝑋) 𝑑𝑋

+ β‹… β‹… β‹… + ∫

𝑄/π‘‰π‘›βˆ’1

0

[

[

𝑋

π‘›βˆ’1

βˆ‘

𝑗=0

𝛼𝑗𝑑𝑗+ 𝛼𝑛(𝑄 βˆ’ 𝑉

π‘›βˆ’1𝑋)]

]

β‹… 𝑓 (𝑋) 𝑑𝑋.

(13)

The necessary condition for 𝑄 to be optimal is given by

𝑑Π𝑁

𝑒(𝑄)

𝑑𝑄= 𝛼0βˆ’

π‘›βˆ’1

βˆ‘

𝑗=0

(𝐢𝑗+1

βˆ’ 𝐢𝑗) 𝐹(

𝑄

𝑉𝑗

) = 0. (14)

The second-order derivative of Π𝑁𝑒(𝑄) is given by 𝑑

2Π𝑁

𝑒(𝑄)/

𝑑𝑄2

= βˆ’βˆ‘π‘›βˆ’1

𝑗=0(1/𝑉𝑗)(𝐢𝑗+1

βˆ’ 𝐢𝑗)𝑓(𝑄/𝑉

𝑗). Because 𝑓(𝑋) β‰₯ 0

and 𝐢𝑗+1

βˆ’ 𝐢𝑗β‰₯ 0, 𝑑2Π𝑁

𝑒(𝑄)/𝑑𝑄

2≀ 0 for 𝑄 β‰₯ 0 and hence

Π𝑁

𝑒(𝑄) is concave.Similar to the previous section, we formulate and

solve the newsboy problem with multiple upgrades by thedistribution-free approach. In this case, the profit function(πœ‹π‘Šπ‘’

(𝑄)) can be represented as follows:

πœ‹π‘Š

𝑒(𝑄) =

{{{{{{{{{{{{{{{{{{

{{{{{{{{{{{{{{{{{{

{

𝛼0𝑑0𝑄 if 𝑄

𝑉0

≀ 𝑋

𝛼0𝑑0𝑄 βˆ’ 𝑒

1𝐢 (𝑄 βˆ’ 𝑉

0𝑋) if 𝑄

𝑉1

≀ 𝑋 <𝑄

𝑉0

𝛼0𝑑0𝑄 βˆ’ 𝑒

1𝐢 (𝑄 βˆ’ 𝑉

0𝑋) βˆ’ (𝑒

2βˆ’ 𝑒1) 𝐢 (𝑄 βˆ’ 𝑉

1𝑋) if 𝑄

𝑉2

≀ 𝑋 <𝑄

𝑉1

.

.

....

𝛼0𝑑0𝑄 βˆ’ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

) (𝑄 βˆ’ π‘‰π‘—βˆ’1

𝑋) if 0 ≀𝑄

π‘‰π‘›βˆ’1

.

(15)

The expected value of πœ‹π‘Šπ‘’

(𝑄) is given by

Ξ π‘Š

𝑒(𝑄) = 𝛼

0𝑑0𝑄 βˆ’ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

) 𝐸 (𝑄 βˆ’ π‘‰π‘—βˆ’1

𝑋)+

= 𝛼0𝑑0𝑄

βˆ’ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)π‘‰π‘—βˆ’1

𝐸(𝑄

π‘‰π‘—βˆ’1

βˆ’ 𝑋)

+

.

(16)

Observing that (𝑄 βˆ’ 𝑋)+

= (𝑄 βˆ’ 𝑋) + (𝑋 βˆ’ 𝑄)+, we can write

the expected profit as

Ξ π‘Š

𝑒(𝑄) = πœ‡πΆ

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)π‘‰π‘—βˆ’1

βˆ’ [

[

𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

) βˆ’ 𝛼0𝑑0]

]

𝑄

βˆ’ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)π‘‰π‘—βˆ’1

𝐸(𝑋 βˆ’π‘„

π‘‰π‘—βˆ’1

)

+

.

(17)

Because maximizing Ξ π‘Š

𝑒(𝑄) is equivalent to minimizing

πΆπ‘Š

𝑒(𝑄), we concentrate on minimizing 𝐢

π‘Š

𝑒(𝑄), where

πΆπ‘Š

𝑒(𝑄) = [

[

𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

) βˆ’ 𝛼0𝑑0]

]

𝑄

+ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)π‘‰π‘—βˆ’1

𝐸(𝑋 βˆ’π‘„

π‘‰π‘—βˆ’1

)

+

.

(18)

Here, βˆ‘π‘›

𝑗=1(𝑒𝑗

βˆ’ π‘’π‘—βˆ’1

) = 𝑒𝑛. Because the distribution 𝐹

of 𝑋 is unknown, we want to minimize πΆπ‘Š

𝑒(𝑄) against the

worst possible distribution.Using Lemma 1, our problemnowreduces to minimizing the upper bound

πΆπ‘Š

𝑒(𝑄) = (𝐢𝑒

π‘›βˆ’ 𝛼0𝑑0) 𝑄 +

1

2𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)

β‹… π‘‰π‘—βˆ’1

{

{

{

[𝜎2+ (

𝑄

π‘‰π‘—βˆ’1

βˆ’ πœ‡)

2

]

1/2

βˆ’ (𝑄

π‘‰π‘—βˆ’1

βˆ’ πœ‡)}

}

}

.

(19)

6 Mathematical Problems in Engineering

The necessary condition for 𝑄 to be optimal is

π‘‘πΆπ‘Š

𝑒(𝑄)

𝑑𝑄

=1

2πΆπ‘’π‘›βˆ’ 𝛼0𝑑0

+1

2𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)(𝑄/π‘‰π‘—βˆ’1

βˆ’ πœ‡)

[𝜎2 + (𝑄/π‘‰π‘—βˆ’1

βˆ’ πœ‡)2

]

1/2

= 0

(20)

which gives

2𝑃

πΆβˆ’ 2 βˆ’ 𝑒

𝑛

=

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)(𝑄/π‘‰π‘—βˆ’1

βˆ’ πœ‡)

[𝜎2 + (𝑄/π‘‰π‘—βˆ’1

βˆ’ πœ‡)2

]

1/2.

(21)

The second-order derivative of πΆπ‘Šπ‘’(𝑄) is given by 𝑑

2πΆπ‘Š

𝑒(𝑄)/

𝑑𝑄2

= πΆβˆ‘π‘›

𝑗=1((π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)𝜎2/π‘‰π‘—βˆ’1

[𝜎2+ (𝑄/𝑉

π‘—βˆ’1βˆ’ πœ‡)2]3/2

).Because 𝑒

π‘—βˆ’ π‘’π‘—βˆ’1

β‰₯ 0, 𝑑2πΆπ‘Šπ‘’

(𝑄)/𝑑𝑄2

β‰₯ 0 for 𝑄 β‰₯ 0 andhence 𝐢

π‘Š

𝑒(𝑄) is convex. Therefore, Ξ π‘Š

𝑒(𝑄) is concave.

2.3. The Mixed Newsboy Problem with Progressive MultipleDiscounts and Upgrades. Multiple discounts lead to higherorder quantities compared to the one found in the classi-cal newsboy problems because multiple discounts result inincreased demand at prices that are higher than the salvagevalue in the classical newsboy problem. More practically, thediscount policy is not the only way to sell excess products.Sellers make additional investment in marketing to attractmore customers to stores through progressive discounts.Bridson et al. [39] suggested that an appropriate mix of hardattributes (discounts and coupons) and soft attributes (betterservice, upgrades, and special attention) can affect cus-tomer satisfaction with stores. Therefore, when consideringthe mixed model with progressive multiple discounts andupgrades (i.e., multiple discounts with progressively increas-ing costs), the profit function of the model is given by

πœ‹π‘Š

𝑑𝑒(𝑄)

=

{{{{{{{{{{{{{{{{{{{{{{{{{{{{

{{{{{{{{{{{{{{{{{{{{{{{{{{{{

{

𝛼0𝑑0𝑄 if 𝑄

𝑉0

≀ 𝑋

𝛼0𝑑0𝑄 βˆ’ 𝑑

1𝑃 (𝑄 βˆ’ 𝑉

0𝑋) if 𝑄

𝑉1

≀ 𝑋 <𝑄

𝑉0

𝛼0𝑑0𝑄 βˆ’ 𝑑

1𝑃 (𝑄 βˆ’ 𝑉

0𝑋) βˆ’ 𝑒

1𝐢 (𝑄 βˆ’ 𝑉

1𝑋) if 𝑄

𝑉2

≀ 𝑋 <𝑄

𝑉1

𝛼0𝑑0𝑄 βˆ’ 𝑑

1𝑃 (𝑄 βˆ’ 𝑉

0𝑋) βˆ’ 𝑒

1𝐢 (𝑄 βˆ’ 𝑉

1𝑋) βˆ’ (𝑑

2βˆ’ 𝑑1) 𝑃 (𝑄 βˆ’ 𝑉

2𝑋) if 𝑄

𝑉3

≀ 𝑋 <𝑄

𝑉2

𝛼0𝑑0𝑄 βˆ’ 𝑑

1𝑃 (𝑄 βˆ’ 𝑉

0𝑋) βˆ’ 𝑒

1𝐢 (𝑄 βˆ’ 𝑉

1𝑋) βˆ’ (𝑑

2βˆ’ 𝑑1) 𝑃 (𝑄 βˆ’ 𝑉

2𝑋) βˆ’ (𝑒

2βˆ’ 𝑒1) 𝐢 (𝑄 βˆ’ 𝑉

3𝑋) if 𝑄

𝑉4

≀ 𝑋 <𝑄

𝑉3

.

.

....

𝛼0𝑑0𝑄 βˆ’ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) (𝑄 βˆ’ 𝑉2(π‘—βˆ’1)

𝑋) βˆ’ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

) (𝑄 βˆ’ 𝑉2π‘—βˆ’1

𝑋) if 0 ≀ 𝑋 <𝑄

π‘‰π‘›βˆ’1

,

(22)

where 𝛼𝑗= π‘ƒπ‘—βˆ’ 𝐢𝑗and 𝑉

𝑗= 1 + βˆ‘

𝑗

π‘˜=1π‘‘π‘˜, 𝑑0= 1, and 𝑉

0= 1.

The expected value of πœ‹π‘Šπ‘‘π‘’

(𝑄) is

Ξ π‘Š

𝑑𝑒(𝑄)

= 𝛼0𝑑0𝑄 βˆ’ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) 𝐸 (𝑄 βˆ’ 𝑉2(π‘—βˆ’1)

𝑋)+

βˆ’ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

) 𝐸 (𝑄 βˆ’ 𝑉2π‘—βˆ’1

𝑋)+

= 𝛼0𝑑0𝑄

βˆ’ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)𝑉2(π‘—βˆ’1)

𝐸(𝑄

𝑉2(π‘—βˆ’1)

βˆ’ 𝑋)

+

βˆ’ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)𝑉2π‘—βˆ’1

𝐸(𝑄

𝑉2π‘—βˆ’1

βˆ’ 𝑋)

+

.

(23)

Observing that (𝑄 βˆ’ 𝑋)+

= (𝑄 βˆ’ 𝑋) + (𝑋 βˆ’ 𝑄)+, we can write

the expected profit as

Ξ π‘Š

𝑑𝑒(𝑄)

= πœ‡π‘ƒ

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)𝑉2(π‘—βˆ’1)

Mathematical Problems in Engineering 7

+ πœ‡πΆ

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)𝑉2π‘—βˆ’1

βˆ’ 𝑃𝑄

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)

βˆ’ 𝐢𝑄

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)

βˆ’ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)𝑉2(π‘—βˆ’1)

𝐸(𝑋 βˆ’π‘„

𝑉2(π‘—βˆ’1)

)

+

βˆ’ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)𝑉2π‘—βˆ’1

𝐸(𝑋 βˆ’π‘„

𝑉2π‘—βˆ’1

)

+

+ 𝛼0𝑑0𝑄.

(24)

In the distribution-free approach, maximizing Ξ π‘Š

𝑑𝑒(𝑄) is

equivalent to minimizing πΆπ‘Š

𝑑𝑒(𝑄); we concentrate on mini-

mizing πΆπ‘Š

𝑑𝑒(𝑄), where

πΆπ‘Š

𝑑𝑒(𝑄)

= 𝑃𝑄

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) + 𝐢𝑄

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)

+ 𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)𝑉2(π‘—βˆ’1)

𝐸(𝑋 βˆ’π‘„

𝑉2(π‘—βˆ’1)

)

+

βˆ’ 𝛼0𝑑0𝑄

+ 𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)𝑉2π‘—βˆ’1

𝐸(𝑋 βˆ’π‘„

𝑉2π‘—βˆ’1

)

+

.

(25)

Because the distribution 𝐹 of 𝑋 is unknown, we want tominimize 𝐢

π‘Š

𝑑𝑒(𝑄) against the worst possible distribution.

Using Lemma 1, our problem now reduces to minimizing theupper bound

πΆπ‘Š

𝑑𝑒(𝑄) = 𝑃𝑄

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

) + 𝐢𝑄

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)

βˆ’ 𝛼0𝑑0𝑄 +

1

2𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)

β‹… 𝑉2(π‘—βˆ’1)

{

{

{

[𝜎2+ (

𝑄

𝑉2(π‘—βˆ’1)

βˆ’ πœ‡)

2

]

1/2

+ (𝑄

𝑉2(π‘—βˆ’1)

βˆ’ πœ‡)}

}

}

+1

2𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)

β‹… 𝑉2π‘—βˆ’1

{

{

{

[𝜎2+ (

𝑄

𝑉2π‘—βˆ’1

βˆ’ πœ‡)

2

]

1/2

+ (𝑄

𝑉2π‘—βˆ’1

βˆ’ πœ‡)}

}

}

.

(26)

Thenecessary condition for𝑄 to be optimal isπ‘‘πΆπ‘Š

𝑑𝑒(𝑄)/𝑑𝑄 =

0, which gives

2𝛼0𝑑0βˆ’ π‘ƒπ‘‘π‘›βˆ’ 𝐢𝑒𝑛

=1

2𝐢

𝑛

βˆ‘

𝑗=1

(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)(𝑄/𝑉2π‘—βˆ’1

βˆ’ πœ‡)

[𝜎2 + (𝑄/𝑉2π‘—βˆ’1

βˆ’ πœ‡)2

]

1/2

+1

2𝑃

𝑛

βˆ‘

𝑗=1

(π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)(𝑄/𝑉2(π‘—βˆ’1)

βˆ’ πœ‡)

[𝜎2 + (𝑄/𝑉2(π‘—βˆ’1)

βˆ’ πœ‡)2

]

1/2.

(27)

The second-order derivative of πΆπ‘Šπ‘‘π‘’

(𝑄) is given by

𝑑2πΆπ‘Š

𝑑𝑒(𝑄)

𝑑𝑄2

= 𝐢

𝑛

βˆ‘

𝑗=1

(1

𝑉2π‘—βˆ’1

)(π‘’π‘—βˆ’ π‘’π‘—βˆ’1

)

β‹…πœŽ2

[𝜎2 + (𝑄/𝑉2π‘—βˆ’1

βˆ’ πœ‡)2

]

3/2+ 𝑃

𝑛

βˆ‘

𝑗=1

(1

𝑉2(π‘—βˆ’1)

)

β‹… (π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

)𝜎2

[𝜎2 + (𝑄/𝑉2(π‘—βˆ’1)

βˆ’ πœ‡)2

]

3/2.

(28)

Because π‘’π‘—βˆ’ π‘’π‘—βˆ’1

β‰₯ 0 and π‘‘π‘—βˆ’ π‘‘π‘—βˆ’1

β‰₯ 0, 𝑑2πΆπ‘Šπ‘‘π‘’

(𝑄)/𝑑𝑄2β‰₯ 0

for 𝑄 β‰₯ 0 and hence πΆπ‘Š

𝑑𝑒(𝑄) is convex. Therefore, Ξ π‘Š

𝑑𝑒(𝑄) is

concave.The optimality of the solution for the normal distribution

expected-profit model can be verified by the same methodmentioned above. Hence, the detailed discussion is omitted.

3. The Newsboy Problem withProgressive Multiple Discounts witha Budget or a Storage Constraint

Thepurpose of this section is to investigate the effect of a bud-get or a storage constraint on the optimal order quantities in amultiproduct newsboy problem in which multiple discountsor upgrades are used to sell excess inventory. The followingadditional notations are used in this section to develop thenewsboy problem applied to multiple products:

𝑖: the product index.𝐼: the number of products.𝑗: the discounted index.𝑛: the number of discounts offered.𝑃𝑖: the unit selling price offered for product 𝑖.

𝐢𝑖: the unit cost offered for product 𝑖.

𝑆𝑖: the salvage value offered for product 𝑖.

𝑑𝑖,𝑗: the 𝑗th discounted rate for product 𝑖

(0 ≀ 𝑑𝑖,𝑗

≀ 1), 0 = 𝑑𝑖,0

< 𝑑𝑖,1

< 𝑑𝑖,2

< β‹… β‹… β‹… < 𝑑𝑖,𝑛.

𝑃𝑖,𝑗: the 𝑗th discounted selling price for product 𝑖,

𝑃𝑖,𝑗

= (1 βˆ’ 𝑑𝑖,𝑗)𝑃𝑖.

8 Mathematical Problems in Engineering

πœ‡π‘–: the expected demand for product 𝑖.

πœŽπ‘–: the standard deviation of demand for product 𝑖.

π‘˜π‘–: the storage space needed per unit of product 𝑖.

𝑄𝑖: the order quantity for product 𝑖.

𝑑𝑖,𝑗: the fraction of the realized demand of product 𝑖

at the original price that can additionally be sold bydiscounting the product to price 𝑃

𝑖,𝑗.

𝐾: the total storage capacity.𝐡: the budget for the period.

For the multiproduct problem, the total expected profit(𝐸𝑑(𝑍)) under progressive multiple discount is obtained by

considering the sum of the expected profits for all productsas follows:

𝐸𝑑(𝑍) =

𝐼

βˆ‘

𝑗=1

𝐸𝑑(πœ‹π‘–) , (29)

where 𝐸𝑑(πœ‹π‘–) is the expected profit from the 𝑖th product.

Under the multiproduct problem, we have the followingconstraint optimization problems.

Problem 1. Maximizing the expected profit under a storageconstraint,

Max 𝐸𝑑(𝑍)

Subject to𝐼

βˆ‘

𝑗=1

π‘˜π‘–π‘„π‘–β‰€ 𝐾, 𝑄

𝑖β‰₯ 0, 𝑖 = 1, 2, . . . , 𝐼.

(P1)

Problem 2. Maximizing the expected profit under a budgetconstraint,

Max 𝐸𝑑(𝑍)

Subject to𝐼

βˆ‘

𝑗=1

𝐢𝑖𝑄𝑖≀ 𝐡, 𝑄

𝑖β‰₯ 0, 𝑖 = 1, 2, . . . , 𝐼.

(P2)

We concentrate on problem 1 (P1) due to the heavysimilarities between the formulations of (P1) and (P2). All thefollowing results apply to problem 2 (P2) by replacing π‘˜

𝑖and

𝐾 with 𝐢𝑖and 𝐡, respectively. The necessary conditions for

𝑄𝑖(𝑖 = 1, 2, . . . , 𝐼) to be optimal are as follows.In the traditional approach,

πœ•πΈπ‘‘(𝑍)

πœ•π‘„π‘–

= 𝛼0βˆ’

π‘›βˆ’1

βˆ‘

𝑗=0

(𝑃𝑖,𝑗

βˆ’ 𝑃𝑖,𝑗+1

) 𝐹(𝑄𝑖

𝑉𝑖,𝑗

) βˆ’ πœ†1π‘˜π‘–

= 0, βˆ€π‘–.

(30)

In the distribution-free approach,πœ•πΆπ‘‘(𝑍)

πœ•π‘„π‘–

=2𝐢𝑖

𝑃𝑖

+ 𝑑𝑖,𝑛

βˆ’ 2

+

𝑛

βˆ‘

𝑗=1

(𝑑𝑖,𝑗

βˆ’ 𝑑𝑖,π‘—βˆ’1

)(𝑄𝑖/𝑉𝑖,π‘—βˆ’1

βˆ’ πœ‡π‘–)

[𝜎2𝑖+ (𝑄𝑖/𝑉𝑖,π‘—βˆ’1

βˆ’ πœ‡π‘–)2

]

1/2

βˆ’2πœ†1π‘˜π‘–

𝑃𝑖

= 0, βˆ€π‘–,

(31)

whereπœ†1(> 0) is the Lagrangemultiplier and𝐢

𝑑(𝑍) is the cost

function under the distribution-free approach. Algorithm 1 isused to find the optimal 𝑄

𝑖, 𝑖 = 1, 2, . . . , 𝐼.

Algorithm 1.

Step 1. Find 𝑄𝑖, 𝑖 = 1, 2, . . . , 𝐼, using an unconstrained

solution.If βˆ‘πΌπ‘—=1

π‘˜π‘–π‘„π‘–β‰€ 𝐾, the solution is optimal.

Otherwise, set πœ†1π‘ˆ

= Max[(𝑃𝑖,0

βˆ’ 𝐢𝑖)/π‘˜π‘–] and πœ†

1𝐿= 0

and go to Step 2.

Step 2. Set a sufficiently small computational accuracyparameter πœ– > 0.

Set πœ†1𝑀

= (πœ†1π‘ˆ

+ πœ†1𝐿

)/2. Using πœ†1𝐿, solve (30) or (31) for

𝑖 = 1, 2, . . . , 𝐼.

If no solution exists for product 𝑖, set 𝑄𝑖= 0.

Otherwise, find 𝑄𝑖and go to Step 3.

Step 3. If βˆ‘πΌπ‘—=1

π‘˜π‘–π‘„π‘–> 𝐾, set πœ†

1𝐿= πœ†1𝑀

and go to Step 2.If βˆ‘πΌπ‘—=1

π‘˜π‘–π‘„π‘–< 𝐾, πœ†

1π‘ˆβˆ’ πœ†1𝑀

> πœ– are satisfied.Set πœ†π‘ˆ

= πœ†π‘€.

Go to Step 2.Otherwise, the solution is optimal.

Similarly, we can formulate the newsboy problem withprogressive multiple upgrades with a budget or storageconstraint. The necessary conditions for 𝑄

𝑖(𝑖 = 1, 2, . . . , 𝐼)

to be optimal under progressive multiple upgrades are asfollows.

In the traditional approach,

πœ•πΈπ‘’(𝑍)

πœ•π‘„π‘–

= 𝛼0βˆ’

π‘›βˆ’1

βˆ‘

𝑗=0

(𝐢𝑖,𝑗+1

βˆ’ 𝐢𝑖,𝑗) 𝐹(

𝑄𝑖

𝑉𝑖,𝑗

) βˆ’ πœ†1π‘˜π‘–

= 0, βˆ€π‘–.

(32)

In the distribution-free approach,

πœ•πΆπ‘’(𝑍)

πœ•π‘„π‘–

=2𝑃𝑖

𝐢𝑖

βˆ’ 𝑒𝑖,𝑛

βˆ’ 2

+

𝑛

βˆ‘

𝑗=1

(𝑒𝑖,𝑗

βˆ’ 𝑒𝑖,π‘—βˆ’1

)(𝑄𝑖/𝑉𝑖,π‘—βˆ’1

βˆ’ πœ‡π‘–)

[𝜎2𝑖+ (𝑄𝑖/𝑉𝑖,π‘—βˆ’1

βˆ’ πœ‡π‘–)2

]

1/2

βˆ’2πœ†1π‘˜π‘–

𝐢𝑖

= 0, βˆ€π‘–.

(33)

The computational results for all four scenarios are shown inthe following section.

4. Numerical Examples

In this section, we provide numerical illustration on how theexpected profits under the general and the distribution-freeapproaches are affected by various cases by using the modelsdeveloped in Sections 2 and 3.

Mathematical Problems in Engineering 9

Example 1. We consider a product with a regular unit priceand a constant unit cost. Discounts of 10%, 20%, 30%, 40%,and 50% off the regular price are progressively used to sellexcess inventory. We also assume that a fraction of theoriginal demand will be realized as additional sales at eachof the first four discounted prices: 𝑑

1= 0.1, 𝑑

2= 0.1, 𝑑

3= 0.2,

and 𝑑4

= 0.3. Furthermore, we assume that an unlimitedquantity can be sold at the fifth discount price. In addition,𝑃 = $10 per unit, 𝐢 = $7.5 per unit, 𝑆 = $5 per unit, πœ‡ = 100

unit, and 𝜎 = 15 unit. We compare the performance of 𝑄𝑁𝑑

withπ‘„π‘Š

𝑑. The results are (normal distribution in parenthesis)

π‘„π‘Š

𝑑= 122.0732units (𝑄𝑁

𝑛= 122.5361units) and aworst-case

expected profit of Ξ π‘Šπ‘‘(𝑄) = $257.4775 (Π𝑁

𝑑= $257.4845). The

Expected Value of Additional Information (EVAI) is $0.007.Additionally, if the management did not consider multiplediscounts and immediately discounted the product’s pricefrom $10 to $5, the optimal quantity would be the samecompared to the result from the classical newsboy problem of100 units with the corresponding expected profit of $154.89.Therefore, we show that progressive multiple discounts areprofitable for the seller.

Example 2. We use the same data as in Example 1 forcomparison. In this example, we consider a product witha regular unit cost and a constant unit price. Upgrades of13.33%, 26.67%, 40%, 53.33%, and 66.67%, added withoutincreasing the cost, are progressively used to sell excessinventory. We also assume that a fraction of the originaldemand will be realized as additional sales at each of thefirst four upgrade costs: 𝑑

1= 0.1, 𝑑

2= 0.1, 𝑑

3= 0.2, and

𝑑4

= 0.3. An unlimited quantity can be sold at the salvagevalue. The results show (normal distribution in parenthesis)π‘„π‘Š

𝑒= 122.0732 units (𝑄𝑁

𝑒= 122.5361 units) and a worst-

case expected profit ofΞ π‘Šπ‘’(𝑄) = $257.4775 (Π𝑁

𝑒= $257.4845).

The value of EVAI is $0.007. The model with discounts isequivalent to the model with upgrades. Therefore, if theimpacts of discounts and upgrades are uniform, then theseller can use either strategy to increase profit.

Example 3. We use the same data as in Example 1 forcomparison. We consider discounts of 10%, 20%, 30%, 40%,and 50% off the regular price and upgrades of 5%, 10%, 15%,and 20% are progressively used, with no increase in price, tosell excess inventory.We assume thatmanagement offers fourdiscounts and four upgrades before offering the product atsalvage value. The first discount is 10% off the original priceand results in 10% additional sales (𝑑

1= 0.1), and the first

upgrade is 5% of the original cost and results in 5% additionalsales (𝑑

2= 0.05). The second discount is 20% off the original

price and results in 10% additional sales (𝑑3

= 0.1), and thesecond upgrade is 10% of the original cost and results in 5%additional sales (𝑑

4= 0.05). The third discount is 30% off

the original price and results in 20% additional sales (𝑑5

=

0.2). The third upgrade is 15% of the original cost and resultsin 10% additional sales (𝑑

6= 0.1). The fourth discount is

40% off the original price and results in 30% additional sales(𝑑7= 0.3). The fourth upgrade is 20% of the original cost and

results in 15% additional sales (𝑑8

= 0.15), while unlimited

quantity can be sold at the salvage value. The results show(normal distribution in parenthesis) π‘„π‘Š

𝑑𝑒= 121.5615 (𝑄𝑁

𝑑𝑒=

122.2547) and a worst-case expected profit of Ξ π‘Š

𝑑𝑒(𝑄) =

$258.4478 (Π𝑁𝑑𝑒

= $258.4653). The value of EVAI is $0.0174.Examples 1, 2, and 3 show that the expected profit is

increased and the order quantity is decreased when theseller applies both discounts and upgrades. Therefore, wecan conclude that simultaneous discounts and upgrades mayprofit the seller.

Example 4. We consider a newsboy problem with five prod-ucts. The total space available for the products is 7000 ft3. Weassume that, for each product, the management offers twodiscounts before offering the product at salvage value. Thefirst discount is 10% off the original price and results in 10%additional sales (𝑑

𝑖,1= 0.1), and the second discount is 25%

off the original price and results in 20% additional sales (𝑑𝑖,2

=

0.2). Unlimited quantity can be sold at the third discountprice. The third discount on items 1 and 5 is 50% off theoriginal price, while it is 35%offon item2, 45.5%offon item3,and approximately 53.1% off on item 4.The optimal results forthe normally distributed demand and unknown distributeddemand are shown in Table 1.

First, we solve the unconstrained problem.The total spacerequired for this problem is 14, 251 f t3 which exceeds thetotal available space. The total expected profit for the worstcase and the normal distribution is $34111.05 and $34111.26,respectively. The value of EVAI is $0.21. Using the proposedalgorithm (Algorithm 1), we start with πœ†

1π‘ˆ= 6.47, which is

Max[(𝑃𝑖,0

βˆ’ 𝐢𝑖)/π‘˜π‘–] for Product 4. Under the normal distri-

bution of demand, the optimal value of πœ†1is πœ†βˆ—

1= 1.8916,

and, under the distribution-free approach, the optimal valueis πœ†βˆ—

1= 1.8186. The new optimal solution demonstrates

that, under the normal distribution demand, total storageof 7000 f t3 (sum of the 11th row) is needed, and, underthe distribution-free approach, total storage of 6999.82 f t3 isneeded. The total expected profit for the normal distributionand the worst case is $24439.74 and $24436.73, respectively.The value of EVAI is $3.01. Moreover, from Example 4,we conclude that the ordering decision determined by thenewsboy problem in the multiple-item environment is highlyinfluenced by an additional constraint. Finally, all of the aboveexamples demonstrate the robustness of the distribution-freeapproach.

5. Concluding Remarks

Motivated by the discounts and the quality upgrade strategypractices in the real world, we extend and derive the optimalordering rule for the newsboy problem with multiple dis-counts, multiple upgrades, and the combined uses of bothstrategies in single- and multiple-item environments. Weadopt the distribution-free approach where only availableinformation is the mean and standard deviation of demandand compare the results with those found through thetraditional approach. We conclude that the distribution-freeapproach is robust from computational results. Experimentswith numerical data under an identical environment indicate

10 Mathematical Problems in Engineering

Table 1: Data and the optimal results for the basic and distribution-free model with a storage constraint.

Parameter 1 2 3 4 5𝑃𝑖

120 100 220 160 130𝐢𝑖

80 75 170 105 100𝑆𝑖

60 (0.5) 65 (0.35) 120 (0.455) 75 (0.531) 65 (0.5)πœ‡π‘–

200 250 120 150 180πœŽπ‘–

40 50 15 30 40π‘˜π‘–

21 7 12 8.5 16.25

Withoutstorageconstraint

𝑄𝑁

𝑖257.57 315.46 138.82 192.18 205.20

π‘„π‘Š

𝑖257.40 314.33 138.80 192.15 205.84

πœ‹π‘

𝑖(𝑄𝑁

𝑖) 8246.49 6277.35 6071.14 8495.51 5020.77

πœ‹π‘Š

𝑖(π‘„π‘Š

𝑖) 8246.49 6277.24 6071.14 8495.51 5020.67

Withstorageconstraint

𝑄𝑁

𝑖107.94 253.05 124.89 172.14 0

π‘„π‘Š

𝑖105.86 257.18 125.14 173.50 0

πœ‹π‘

𝑖(𝑄𝑁

𝑖) 4313.66 5876.84 5911.79 8337.45 0

πœ‹π‘Š

𝑖(π‘„π‘Š

𝑖) 4231.19 5929.64 5917.35 8358.55 0

that a greater number of discounts and upgrades are associ-ated with greater expected profits. The result offers a noveladdition to the literature on the newsboy problem.

The study proposes several directions for future research.The developed model under a multiple-item scenarioassumes the presence of independent demand and the influ-ence of discounts or upgrades for various products.Therefore,we encourage the development of a new approach whereresearchers also consider demand substitution effect andprice-dependent demand as well as bundle discounts undervarious distribution functions. In addition, researchers mayextend all the models in the supply chain framework tostudy the effect of bargaining power of channel members ondiscounts or upgrades.

Competing Interests

The authors declare that they have no competing interests.

Acknowledgments

This research was supported by the National Research Foun-dation ofKorea (NRF) funded by theMinistry of Science, ICT& Future Planning (2015R1A2A1A15053948).

References

[1] H. Scarf, β€œAminmax solution of an inventory problem,” in Stud-ies in the Mathematical Theory of Inventory and Production, pp.201–209, Stanford University Press, Stanford, Calif, USA, 1958.

[2] G. Gallego and I. Moon, β€œThe distribution free newsboyproblem: review and extensions,” Journal of the OperationalResearch Society, vol. 44, no. 8, pp. 825–834, 1993.

[3] I. Moon and G. Gallego, β€œDistribution free procedures for someinventory models,” Journal of the Operational Research Society,vol. 45, no. 6, pp. 651–658, 1994.

[4] I. Moon and S. Choi, β€œThe distribution free continuous reviewinventory systemwith a service level constraint,”Computers andIndustrial Engineering, vol. 27, no. 1–4, pp. 209–212, 1994.

[5] I. Moon and S. Choi, β€œDistribution free procedures for make-to-order (MTO), make-in-advance (MIA), and composite poli-cies,” International Journal of Production Economics, vol. 48, no.1, pp. 21–28, 1997.

[6] I. Moon and S. Choi, β€œA note on lead time and distributionalassumptions in continuous review inventory models,” Comput-ers and Operations Research, vol. 25, no. 11, pp. 1007–1012, 1998.

[7] L.-Y. Ouyang and K.-S. Wu, β€œA minimax distribution freeprocedure for mixed inventory model with variable lead time,”International Journal of Production Economics, vol. 56-57, pp.511–516, 1998.

[8] M. Hariga and M. Ben-Daya, β€œSome stochastic inventorymodels with deterministic variable lead time,” European Journalof Operational Research, vol. 113, no. 1, pp. 42–51, 1999.

[9] L.-Y. Ouyang and H.-C. Chang, β€œA minimax distribution freeprocedure for mixed inventory models involving variable leadtime with fuzzy lost sales,” International Journal of ProductionEconomics, vol. 76, no. 1, pp. 1–12, 2002.

[10] M. M. Tajbakhsh, β€œOn the distribution free continuous-reviewinventory model with a service level constraint,” Computers &Industrial Engineering, vol. 59, no. 4, pp. 1022–1024, 2010.

[11] I. Moon, E. Shin, and B. Sarkar, β€œMin-max distribution freecontinuous-review model with a service level constraint andvariable lead time,” Applied Mathematics and Computation, vol.229, pp. 310–315, 2014.

[12] J. Kamburowski, β€œOn the distribution-free newsboy problemwith some non-skewed demands,” Operations Research Letters,vol. 43, no. 2, pp. 165–171, 2015.

[13] M.-H. Shu, C.-W. Yeh, and Y.-C. Fu, β€œImpacts of transportationcost on distribution-free newsboy problems,” MathematicalProblems in Engineering, vol. 2014, Article ID 307935, 10 pages,2014.

[14] W.-M. Ma and B.-B. Qiu, β€œDistribution-free continuous reviewinventory model with controllable lead time and setup cost in

Mathematical Problems in Engineering 11

the presence of a service level constraint,” Mathematical Prob-lems in Engineering, vol. 2012, Article ID 867847, 16 pages, 2012.

[15] H. Bidkhori, D. Simchi-Levi, and Y. Wei, β€œAnalyzing processflexibility: a distribution-free approach with partial expecta-tions,” Operations Research Letters, vol. 44, no. 3, pp. 291–296,2016.

[16] K. Kwon and T. Cheong, β€œA minimax distribution-free proce-dure for a newsvendor problem with free shipping,” EuropeanJournal of Operational Research, vol. 232, no. 1, pp. 234–240,2014.

[17] Y. Qin, R. Wang, A. J. Vakharia, Y. Chen, and M. M. H. Seref,β€œThe newsvendor problem: review and directions for futureresearch,”European Journal of Operational Research, vol. 213, no.2, pp. 361–374, 2011.

[18] G. Hadley and T. M. Whitin, Analysis of Inventory Systems,Prentice-Hall, Englewood Cliffs, NJ, USA, 1963.

[19] E. Carrizosa, A. V. Olivares-Nadal, and P. Ramı́rez-Cobo,β€œRobust newsvendor problem with autoregressive demand,”Computers and Operations Research, vol. 68, pp. 123–133, 2016.

[20] Q. Li, C. Dong, and R. Zhuang, β€œManaging the newsvendormodeled product system with random capacity and capacity-dependent price,” Mathematical Problems in Engineering, vol.2015, Article ID 296132, 10 pages, 2015.

[21] T. Ye and H. Sun, β€œPrice-setting newsvendor with strategicconsumers,” Omega, vol. 63, pp. 103–110, 2016.

[22] N. C. Petruzzi andM.Dada, β€œPricing and the newsvendor prob-lem: a review with extensions,” Operations Research, vol. 47, no.2, pp. 183–194, 1999.

[23] H. Chen and A. R. Rao, β€œWhen two plus two is not equal tofour: errors in processing multiple percentage changes,” Journalof Consumer Research, vol. 34, no. 3, pp. 327–340, 2007.

[24] M. Khouja, β€œThe newsboy problem under progressive multiplediscounts,” European Journal of Operational Research, vol. 84,no. 2, pp. 458–466, 1995.

[25] M. Khouja and A. Mehrez, β€œAmulti-product constrained news-boy problemwith progressivemultiple discounts,”Computers &Industrial Engineering, vol. 30, no. 1, pp. 95–101, 1996.

[26] M. J. Khouja, β€œOptimal ordering, discounting, and pricing inthe single-period problem,” International Journal of ProductionEconomics, vol. 65, no. 2, pp. 201–216, 2000.

[27] I. Moon and E. A. Silver, β€œThe multi-item newsvendor problemwith a budget constraint and fixed ordering costs,” Journal of theOperational Research Society, vol. 51, no. 5, pp. 602–608, 2000.

[28] L. L. Abdel-Malek and R. Montanari, β€œAn analysis of themulti-product newsboy problem with a budget constraint,”International Journal of Production Economics, vol. 97, no. 3, pp.296–307, 2005.

[29] G. Zhang, β€œThe multi-product newsboy problem with supplierquantity discounts and a budget constraint,” European Journalof Operational Research, vol. 206, no. 2, pp. 350–360, 2010.

[30] S. Nahmias and C. P. Schmidt, β€œAn efficient heuristic for themulti-item newsboy problem with a single constraint,” NavalResearch Logistics, vol. 31, no. 3, pp. 463–474, 1984.

[31] H.-S. Lau and A. H.-L. Lau, β€œThe newsstand problem: a capaci-tatedmultiple-product single-period inventory problem,” Euro-pean Journal of Operational Research, vol. 94, no. 1, pp. 29–42,1996.

[32] S. J. Erlebacher, β€œOptimal and heuristic solutions for the multi-item newsvendor problem with a single capacity constraint,”Production and Operations Management, vol. 9, no. 3, pp. 303–318, 2000.

[33] M. Mussa and S. Rosen, β€œMonopoly and product quality,”Journal of Economic Theory, vol. 18, no. 2, pp. 301–317, 1978.

[34] D. A. Garvin, β€œWhat does product quality really mean,” MITSloan Management Review, vol. 26, pp. 25–43, 1984.

[35] Toyota, β€œNew initiatives for quality improvement,” Toyko, 2012,http://www.toyota-global.com/company/history of toyota/75years/text/entering the automotive business/chapter2/sec-tion1/item3.html.

[36] L. A. Crosby, K. R. Evans, and D. Cowles, β€œRelationship qualityin services selling: an interpersonal influence perspective,”Journal of Marketing, vol. 54, no. 3, pp. 68–81, 1990.

[37] X. Xu, β€œOptimal price and product quality decisions in a distri-bution channel,” Management Science, vol. 55, no. 8, pp. 1347–1352, 2009.

[38] P. Ma, H. Wang, and J. Shang, β€œSupply chain channel strategieswith quality andmarketing effort-dependent demand,” Interna-tional Journal of Production Economics, vol. 144, no. 2, pp. 572–581, 2013.

[39] K. Bridson, J. Evans, and M. Hickman, β€œAssessing the relation-ship between loyalty program attributes, store satisfaction andstore loyalty,” Journal of Retailing and Consumer Services, vol. 15,no. 5, pp. 364–374, 2008.

Submit your manuscripts athttp://www.hindawi.com

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

MathematicsJournal of

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Mathematical Problems in Engineering

Hindawi Publishing Corporationhttp://www.hindawi.com

Differential EquationsInternational Journal of

Volume 2014

Applied MathematicsJournal of

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Probability and StatisticsHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Journal of

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Mathematical PhysicsAdvances in

Complex AnalysisJournal of

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

OptimizationJournal of

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

CombinatoricsHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

International Journal of

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Operations ResearchAdvances in

Journal of

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Function Spaces

Abstract and Applied AnalysisHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

International Journal of Mathematics and Mathematical Sciences

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

The Scientific World JournalHindawi Publishing Corporation http://www.hindawi.com Volume 2014

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Algebra

Discrete Dynamics in Nature and Society

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Decision SciencesAdvances in

Discrete MathematicsJournal of

Hindawi Publishing Corporationhttp://www.hindawi.com

Volume 2014 Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

Stochastic AnalysisInternational Journal of


Top Related