# Multiproduct Multiperiod Newsvendor Problem with Dynamic Market Efforts

Authors: Jianmai Shi; Yiping Bao
Journal: Discrete Dynamics in Nature and Society
 (2016)

---

## Abstract

We study a multiperiod multiproduct production planning problem where the production capacity and the marketing effort on demand are both considered. The accumulative impact of marketing effort on demand is captured by the Nerlove and Arrow (N-A) advertising model. The problem is formulated as a discrete-time, finite-horizon dynamic optimization problem, which can be viewed as an extension to the classic newsvendor problem by integrating with the N-A model. A Lagrangian relaxation based solution approach is developed to solve the problem, in which the subgradient algorithm is used to find an upper bound of the solution and a feasibility heuristic algorithm is proposed to search for a feasible lower bound. Twelve kinds of instances with different problem size involving up to 50 products and 15 planning periods are randomly generated and used to test the Lagrangian heuristic algorithm. Computational results show that the proposed approach can obtain near optimal solutions for all the instances in very short CPU time, which is less than 90 seconds even for the largest instance.


---

## Body

## 1. Introduction

In the classic newsvendor problem, the retailer determines the optimal inventory level at the beginning of the sale season when facing an uncertain demand. There is an inventory or handling cost for the unsold products at the end of the season when the prepared inventory is over the actual demand. Usually, there is also a punishing cost for the unmet demand when the inventory level is less than the actual demand during the season. As the enriched practical applications and theoretical meaning, the newsvendor problem has been studied by numerous researchers during last decades. Comprehensive reviews on this topic can be found in works by Khouja [1], Petruzzi and Dada [2], and Qin et al. [3].In this paper, we investigate a multiperiod production planning problem for multiple products, where the uncertain demand and the accumulated effort of market investment (e.g., advertisement) on demand are considered. The problem is formulated as a discrete-time, finite-horizon dynamic optimization problem, which can be viewed as an extension to the classic newsvendor problem.Production/inventory management and marketing are both critical to the firm’s success. Production-inventory systems are usually controlled with constant safety stock strategy in the situation with sufficient production capacity. However, optimal allocation of production capacity among the multiple products becomes quite important when the capacity is insufficient [4]. Also, production and inventory plans should be optimized according to the dynamic changes of seasonal demands in the planning horizon, which brings great challenges on the model and solution approach. In the other aspect, marketing efforts on the product can create and increase its demand, which simultaneously bring costs along with revenue. In practical business, many firms manage the production-inventory systems as well as the dynamic investment on marketing efforts, such as Huawei in China. Thus, coordinately optimization of production and marketing decisions is critical for this kind of firms and can further increase the efficiency for utilizing production capacity and marketing investment, which is a new opportunity for increasing profit.Most current operations research and management science literatures study production-inventory and marketing problems separately for the newsvendor-type products. A widely used method for formulating the multiperiod production/inventory problem with random demand is to extend the single-period newsvendor problem to a multiperiod one, which is applied to optimize the production-inventory policy over a finite number of periods. Sox and Muckstadt [4] presented an approximate formulation and solution algorithm for the multiproduct multiperiod capacitated production planning problem with random demand, where the market effort is not considered. Matsuyama [5] presented a formulation for the single product multiperiod newsvendor problem, where the initial inventory level of each period is optimized to maximize the overall expected profit. Kogan and Portougal [6] investigate the optimization of control decisions for the multiperiod aggregate production planning problem in a newsvendor framework. Bensoussan et al. [7] investigated a multiperiod newsvendor problem with partially observed demand and presented a dynamic program, through which an optimal feedback ordering policy is obtained. Pan et al. [8] studied the two-period pricing and ordering problem with demand uncertainty in a declining price environment, where the pricing and ordering decisions are controlled by the dominant retailer and can be dynamically optimized based on market demand forecast. Bisi et al. [9] studied the stochastic multiperiod inventory problem where demand in excess of available inventory is lost and unobserved. Thus, the demand data are censored and a Bayesian scheme is used to dynamically update the demand distribution. Xu [10] investigated the optimal myopic inventory policy for the single-product multiperiod stochastic inventory problem with batch ordering, where the capacity is purchased as the beginning of the planning horizon. Zhang et al. [11] introduced an online learning method from the field of prediction with expert advice to study the multiperiod newsvendor problem. Kim et al. [12] developed a multistage stochastic programming model for the multiperiod newsvendor problem, which is solved by an extended progressive hedging method. Zhang and Yang [13] investigated a two-product multiperiod stationary newsvendor problem where the two products’ total demands are fixed. Cárdenas-Barrón et al. [14] developed a new algorithm based on a reduce and optimize approach and a new valid inequality to solve the multiproduct multiperiod inventory lot sizing with supplier selection problem.Most of current studies on multiperiod production/inventory problem with uncertain demand do not consider the impact of dynamic advertisement. In marketing literature, the long-term carryover effects of advertisement are usually described in distributed lag models [15–17]. Berkowitz et al. [18] developed a distributed lag model that estimates the impact of advertising on sales where different media have different lag structures. Herrington and Dempsey [19] compared the current and lagged effects of national-sponsor advertising to that of local and regional sponsors in the automobile industry. Breuer et al. [20] analyzed the short- and long-term effectiveness of different types of online advertising channels by incorporating separate time lags for each advertising channel. Aravindakshan and Naik [21] proposed a general multiple distributed lag framework for estimating Major League Baseball attendance drivers, which focuses specifically on the differential direct and carryover effects of in-game promotions.Several dynamic advertising models have been developed in marketing literatures, of which the Nerlove-Arrow (N-A) model is the most commonly used in theoretical and empirical analyses to estimate carryover effects aggregated by advertisement [21, 22]. N-A model is first proposed by Nerlove and Arrow [23] for describing the demand under the impact of dynamic advertisements, which introduces a definition of the “goodwill” stock to summarize the impacts of current and past advertisement on demand. Then the N-A model is widely suited and extended to construct a variety of demand functions in the marketing and operations management areas [24]. Srinivasan [25] developed a discrete form of the N-A model to optimize advertising media plans for T-periods. Bass et al. [26] proposed an extension for N-A model that jointly considers the effects of wearout as well as that of forgetting in the context of multiple advertising themes. Erickson [27] developed an extension for N-A model to formulate the goodwill evolution and presented a price- and advertising-dependent demand function. Aravindakshan et al. [28] extended the Nerlove-Arrow model to incorporate owned and earned media activities along with paid media, which is used to help blood bank marketing managers understand how blood donations can be impacted by managing online media. Most of current literatures on dynamic advertisement concern the optimal policy of dynamic investment on advertisement and their influence on demand, and few of them consider the impact on production and inventory decisions.Kraiselburd et al. [29] proposed a study that considered the joint optimization of inventory and marketing effort, which is the most relative work we found in the literatures. They investigated a single-period supply chain consisting of a manufacturer and a retailer and developed a methodology for comparing, stocking quantities, marketing effort, and supply chain profits under different scenarios. The demand is assumed to consist of a deterministic component that depends on the marketing effort and an uncertain component that is not a function of channel effort.As far as we know, there is no literature considering the joint optimization of production and marketing decisions in the dynamic multiperiod scenario. However, production planning and dynamically advertising in a finite horizon with multiple periods and uncertain demand environment become more and more critical for firms to obtain the new profit increasing point in current business world. Motivated by the requirement of practical business and theoretic gap in current literatures, we study the multiproduct multiperiod production planning problem while considering the influence of dynamic advertisement simultaneously.One of the main contributions of this work is the incorporation of the influence of dynamic advertisement on market demand with the classical newsvendor model and developing a new nonlinear programming model for the problem. Also, from a methodology perspective, we integrate the subgradient algorithm and a feasibility search algorithm to solve the arising nonlinear program. Hundreds of randomly generated instances with different sizes are employed to test the computational performance of the proposed solution procedure.The remainder of the paper is organized as follows: In the next section, we present the nonlinear programming formulation of the joint production and advertising problem. We describe the solution approach in Section3. In Section 4, we report the computational performance of the solution approach and a two-product numerical example. The paper is concluded in Section 5.


## 2. Problem Formulation

We assume that the demands are uncertain but their distributions are known, though there is not limitation to the type of the distribution. We consider the vendor faces multiple resource constraints, which can change from period to period. As classical newsvendor problem, we also assume the unit overstocking and understocking costs are given, and the stockouts are backordered in the coming periods.Some notations used in the formulation of our problem are presented in the Notations shown at the end of the paper.LetGit denote the customers’ goodwill for product i in period t and Yit the advertising intensity. According to N-A model, goodwill evolves as the following relationship:(1)Git=Yit+1-δiGi,t-1,where δi is the decay rate of product i representing the decline of memory retention from the previous advertisements.The excepted demand of producti in period t is assumed to depend on goodwill according to the following function:(2)Dit=αit+βitGit,where αit is an intercept in the linear demand function for product i in period t and βit is a measure of the positive effect of goodwill on demand.The cumulative demand of producti through period t is uncertain and can be described as(3)D~itc=∑j=1tDij+uit,where uit is a stochastic variable with a known distribution defined on the range Ait,Bit.The holding and backorder cost of producti in period t can be modeled as(4)πit=sitXit-D~itc,D~itc≤Xit;gitD~itc-Xit,D~itc>Xit.In order to facilitate the formulation, we introduce a decision variable(5)Zit≔Xit-∑j=1tDij;then we can obtain a more convenient formulation for the above model, that is,(6)πit=sitZit-uit,uit≤Zit;gituit-Zit,uit>Zit.The expected holding and backorder cost of producti in period t can be calculated as(7)Eπit=∫AitZitsitZit-uitfituitduit+∫ZitBitgituit-Zitfituitduit.The expected profit of producti in the planning horizon is as follows:(8)Eiprofit=pi∫AiTZiT∑t=1TDit+uiTfituitduit+∫ZiTBiT∑t=1TDit+ZiTfituitduit-∑t=1TEπit-ci∑t=1TDit+ZiT-∑t=1TwiYit2.The multiproduct multiperiod production planning problem can be formulated as(9)maxΠ=∑i=1IEiprofit(10)s.t.∑i=1IhiDit+Zit-Zi,t-1≤Ht,∀t,(11)Dit+Zit-Zi,t-1≥0,∀i,t,(12)Git=Yit+1-δiGi,t-1,(13)Ait≤Zit≤Bit,(14)Git≥0,(15)Yit≥0.Objective (8) is to maximize the overall profit for all products in the planning horizon. Constraints (10) ensure that the total capacity consumed in period t should be no more than the available capacity in that period, which come from ∑i=1IhiXit-Xi,t-1≤Ht by substituting (5). Constraints (11) ensure that the cumulative production quantity for product i is nondecreasing, which comes from Xit≥Xi,t-1 by substituting (5). Constraints (12) state the dynamic evolution of goodwill for product i. Constraints (13)–(15) restrict the ranges for variables.


## 3. Solution Approach

In this section, we present a solution approach for model (9)–(15) based on the Lagrangian relaxation, in which the subgradient algorithm is applied to solve the Lagrangian dual problem and a feasibility heuristic is used to find a feasible lower bound.


### 3.1. Lagrangian Relaxation and Decomposition

We make Lagrangian relaxation for constraints (10) and (11); then we can obtain the following function:(16)LΠ=∑i=1IEiprofit+∑t=1TλtHt-∑i=1IhiDit+Zit-Zi,t-1+∑t=1T∑i=1IηitDit+Zit-Zi,t-1,where λt and ηit are the corresponding Lagrangian multipliers for constraints (10) and (11), respectively.We can see that the Lagrangian relaxation problem can be decomposed into two independent subproblems: a newsvendor-type subproblem and a dynamic advertising subproblem.The Newsvendor-Type Subproblem (17) N T P i = ∫ A i T Z i T p i u i T - s i T Z i T - u i T f i T u i T d u i T + ∫ Z i T B i T p i Z i T - g i T u i T - Z i T f i T u i T d u i T - c i + λ T h i - η i T Z i T - ∑ t = 1 T - 1 s i t ∫ A i t Z i t Z i t - u i t f i t u i t d u i t + g i t ∫ Z i t B i t u i t - Z i t f i t u i t d u i t + Z i t - λ t + 1 + λ t h i + η i , t + 1 - η i ts.t. (13).The newsvendor-type subproblem is a combination ofT classical newsvendor problems, which can be solved by the following lemma.Lemma 1.
Given the Lagrangian multipliersλt and ηit, the optimal solutions for the newsvendor-type subproblem (17) are as follows:fort=1,2,…,T-1, (18)Zit∗=git+λt+1-λthi-ηi,t+1+ηitgit+sitand fort=T, (19)ZiT∗=pi+giT-ci-λThi+ηiTpi+giT+sit.The proof of Lemma1 is presented in the Appendix.The Dynamic Advertising Subproblem (20) D A P i = ∑ t = 1 T p i - c i - λ t h i + η i t α i t + β i t G i t - w i Y i t 2s.t. (12), (14), and (15).The dynamic advertising subproblem is a discrete N-A model, which can be solved recursively using standard dynamic programming theory. Then we can obtain the proposition for solving this subproblem.Proposition 2.
The optimal solution for the dynamic advertising subproblem is, fort=1,2,…,T,(21)Yit∗=12wi∑j=0T-tbi,t+j1-δij,and the associated goodwill is(22)Git∗=∑j=0t-11-δijYi,t-j∗+1-δitG0,where bit=βitpi-ci-λthi+ηit.The proof of Proposition2 is presented in the Appendix.Proposition2 shows that the optimal investment on advertisement in period t is a function of the Lagrangian multipliers starting from period t.


### 3.2. Subgradient Algorithm

Based on the decomposition and the solutions for two subproblems, we employ subgradient algorithm to solve the Lagrangian dual problem. The main procedure of the subgradient algorithm is presented in Algorithm1.Algorithm 1:Subgradient algorithm.
(1)λt=ηit=0, α=2, LB=0, LR=0, UB=+∞, S=0; (2)while(n≤N & S==0) do (3)for  i=1:I  do (4)for  t=1:T  do (5)      calculateZit∗ by Lemma 1; (6)      calculateYit∗ and Git∗ by Proposition 2; (7)endfor (8)endfor (9)LR=LΠλt,ηit,Zit∗,Yit∗,Git∗; (10)if  UB>LR  then (11)UB=LR; (12)endif (13)    calculateZitf, Yitf, and Gitf by Algorithm 2; (14)if  LB<ΠZitf,Yitf,Gitf  then (15)LB=ΠZitf,Yitf,Gitf; (16)endif (17)norm=∑t=1TλtHt-∑i=1IhiDit+Zit∗-Zi,t-1∗2+∑t=1T∑i=1IηitDit+Zit∗-Zi,t-1∗2; (18)if  norm>0  then (19)stepsize=αLR-LBnorm; (20)else (21)stepsize=stepsize2; (22)endif (23)λ-t=λt, η-it=ηit; (24)for  t=1:T  do (25)λt=max⁡0,λt-stepsize∗Ht-∑i=1IhiDit+Zit∗-Zi,t-1∗; (26)for  i=1:I  do (27)ηit=max⁡0,ηit-stepsize∗Dit+Zit∗-Zi,t-1∗; (28)endfor (29)endfor (30)if  max⁡λ-t-λt,η-it-ηiti=1,…,I,t=1,…,T<0.001  then (31)S=1; (32)endif (33)endwhileAlgorithm 2:Feasibility heuristic.
(1)Zitf=Zit∗, Yitf=Yit∗, Gitf=Git∗, Wt=∑i=1IhiDit+Zit∗-Zi,t-1∗-Ht; (2)for  t=T:1  do (3)if  Wt>0  do (4)for  i=1:I  do (5)if  hiDit+Zitf-Zi,t-1f<Wt  then (6)Zi,t-1f=Dit+Zitf, Wt=Wt-hiDit+Zitf-Zi,t-1f; (7)else (8)Zitf=Zitf-Wt/hi, Wt=0; (9)endif (10)endfor (11)endif (12)endfor (13)for  i=1:I  do (14)for  t=T:1  do (15)if  Dit+Zitf-Zi,t-1f<0  then (16)Zi,t-1f=Dit+Zitf; (17)endif (18)endfor (19)endforIn each iteration of the subgradient algorithm, given the value of the Lagrangian multipliers, a solution for the relaxed problem can be obtained by Lemma1 and Proposition 2. However, this solution may not satisfy constraints (10) and (11), that is, infeasible to the original problem. Thus, a feasibility heuristic, noted as Algorithm 2, is developed to find a feasible solution based on the relaxed solution. The goal of the subgradient algorithm is to find a relaxed upper bound and a feasible lower bound for the original problem. If the gap between the upper bound and the lower bound is small enough, it can be viewed that a near optimal solution is obtained for the original problem.


### 3.3. Feasibility Heuristic

The feasibility heuristic is used to check if all constraints (10) and (11) are satisfied. If there are some constraints that are violated, the heuristic finds them and adjusts the corresponding solution to form a feasible solution for the original problem. The main procedure of the feasibility heuristic is presented in Algorithm 2.The basic idea of the feasibility heuristic algorithm is to find the unsatisfied constraints one by one and fix them through adjusting the relaxed solution. We first check all the capacity constraints (10) and find out the unsatisfied ones. The production quantities of the products are reduced from the one consuming higher capacity to the lower one until the capacity constraints are satisfied. Then all constraints (11) are checked and the unsatisfied ones are found out. We reduce the production quantity of the former period to make the constraint feasible.


## 3.1. Lagrangian Relaxation and Decomposition

We make Lagrangian relaxation for constraints (10) and (11); then we can obtain the following function:(16)LΠ=∑i=1IEiprofit+∑t=1TλtHt-∑i=1IhiDit+Zit-Zi,t-1+∑t=1T∑i=1IηitDit+Zit-Zi,t-1,where λt and ηit are the corresponding Lagrangian multipliers for constraints (10) and (11), respectively.We can see that the Lagrangian relaxation problem can be decomposed into two independent subproblems: a newsvendor-type subproblem and a dynamic advertising subproblem.The Newsvendor-Type Subproblem (17) N T P i = ∫ A i T Z i T p i u i T - s i T Z i T - u i T f i T u i T d u i T + ∫ Z i T B i T p i Z i T - g i T u i T - Z i T f i T u i T d u i T - c i + λ T h i - η i T Z i T - ∑ t = 1 T - 1 s i t ∫ A i t Z i t Z i t - u i t f i t u i t d u i t + g i t ∫ Z i t B i t u i t - Z i t f i t u i t d u i t + Z i t - λ t + 1 + λ t h i + η i , t + 1 - η i ts.t. (13).The newsvendor-type subproblem is a combination ofT classical newsvendor problems, which can be solved by the following lemma.Lemma 1.
Given the Lagrangian multipliersλt and ηit, the optimal solutions for the newsvendor-type subproblem (17) are as follows:fort=1,2,…,T-1, (18)Zit∗=git+λt+1-λthi-ηi,t+1+ηitgit+sitand fort=T, (19)ZiT∗=pi+giT-ci-λThi+ηiTpi+giT+sit.The proof of Lemma1 is presented in the Appendix.The Dynamic Advertising Subproblem (20) D A P i = ∑ t = 1 T p i - c i - λ t h i + η i t α i t + β i t G i t - w i Y i t 2s.t. (12), (14), and (15).The dynamic advertising subproblem is a discrete N-A model, which can be solved recursively using standard dynamic programming theory. Then we can obtain the proposition for solving this subproblem.Proposition 2.
The optimal solution for the dynamic advertising subproblem is, fort=1,2,…,T,(21)Yit∗=12wi∑j=0T-tbi,t+j1-δij,and the associated goodwill is(22)Git∗=∑j=0t-11-δijYi,t-j∗+1-δitG0,where bit=βitpi-ci-λthi+ηit.The proof of Proposition2 is presented in the Appendix.Proposition2 shows that the optimal investment on advertisement in period t is a function of the Lagrangian multipliers starting from period t.


## 3.2. Subgradient Algorithm

Based on the decomposition and the solutions for two subproblems, we employ subgradient algorithm to solve the Lagrangian dual problem. The main procedure of the subgradient algorithm is presented in Algorithm1.Algorithm 1:Subgradient algorithm.
(1)λt=ηit=0, α=2, LB=0, LR=0, UB=+∞, S=0; (2)while(n≤N & S==0) do (3)for  i=1:I  do (4)for  t=1:T  do (5)      calculateZit∗ by Lemma 1; (6)      calculateYit∗ and Git∗ by Proposition 2; (7)endfor (8)endfor (9)LR=LΠλt,ηit,Zit∗,Yit∗,Git∗; (10)if  UB>LR  then (11)UB=LR; (12)endif (13)    calculateZitf, Yitf, and Gitf by Algorithm 2; (14)if  LB<ΠZitf,Yitf,Gitf  then (15)LB=ΠZitf,Yitf,Gitf; (16)endif (17)norm=∑t=1TλtHt-∑i=1IhiDit+Zit∗-Zi,t-1∗2+∑t=1T∑i=1IηitDit+Zit∗-Zi,t-1∗2; (18)if  norm>0  then (19)stepsize=αLR-LBnorm; (20)else (21)stepsize=stepsize2; (22)endif (23)λ-t=λt, η-it=ηit; (24)for  t=1:T  do (25)λt=max⁡0,λt-stepsize∗Ht-∑i=1IhiDit+Zit∗-Zi,t-1∗; (26)for  i=1:I  do (27)ηit=max⁡0,ηit-stepsize∗Dit+Zit∗-Zi,t-1∗; (28)endfor (29)endfor (30)if  max⁡λ-t-λt,η-it-ηiti=1,…,I,t=1,…,T<0.001  then (31)S=1; (32)endif (33)endwhileAlgorithm 2:Feasibility heuristic.
(1)Zitf=Zit∗, Yitf=Yit∗, Gitf=Git∗, Wt=∑i=1IhiDit+Zit∗-Zi,t-1∗-Ht; (2)for  t=T:1  do (3)if  Wt>0  do (4)for  i=1:I  do (5)if  hiDit+Zitf-Zi,t-1f<Wt  then (6)Zi,t-1f=Dit+Zitf, Wt=Wt-hiDit+Zitf-Zi,t-1f; (7)else (8)Zitf=Zitf-Wt/hi, Wt=0; (9)endif (10)endfor (11)endif (12)endfor (13)for  i=1:I  do (14)for  t=T:1  do (15)if  Dit+Zitf-Zi,t-1f<0  then (16)Zi,t-1f=Dit+Zitf; (17)endif (18)endfor (19)endforIn each iteration of the subgradient algorithm, given the value of the Lagrangian multipliers, a solution for the relaxed problem can be obtained by Lemma1 and Proposition 2. However, this solution may not satisfy constraints (10) and (11), that is, infeasible to the original problem. Thus, a feasibility heuristic, noted as Algorithm 2, is developed to find a feasible solution based on the relaxed solution. The goal of the subgradient algorithm is to find a relaxed upper bound and a feasible lower bound for the original problem. If the gap between the upper bound and the lower bound is small enough, it can be viewed that a near optimal solution is obtained for the original problem.


## 3.3. Feasibility Heuristic

The feasibility heuristic is used to check if all constraints (10) and (11) are satisfied. If there are some constraints that are violated, the heuristic finds them and adjusts the corresponding solution to form a feasible solution for the original problem. The main procedure of the feasibility heuristic is presented in Algorithm 2.The basic idea of the feasibility heuristic algorithm is to find the unsatisfied constraints one by one and fix them through adjusting the relaxed solution. We first check all the capacity constraints (10) and find out the unsatisfied ones. The production quantities of the products are reduced from the one consuming higher capacity to the lower one until the capacity constraints are satisfied. Then all constraints (11) are checked and the unsatisfied ones are found out. We reduce the production quantity of the former period to make the constraint feasible.


## 4. Computational Performance and Managerial Insight

In order to analyze the performance of the solution approach, we randomly generate 1,200 instances of problem, all of which are solved by the proposed solution approach. The set of tested instances includes four different product lists: 5, 10, 25, and 50 products, respectively. For each product list, different planning horizons including 5, 10, and 15 periods are considered. Thus, there are 12 kinds of instances with different problem size, and 100 instances are randomly generated for each problem size. The demands for all the products are assumed to follow normal distribution. The summarized computational performance for all the instances is presented in Table1. The computational experiment is conducted on a Lenovo laptop with Intel® Core™ i5-4200U CPU @ 1.60 GHz 2.30 GHz processor and 8 GB of RAM. The program is coded in MATLAB.Table 1
The computational performance of the solution approach.
⁢Problem size Gap (E-04) CPU time (seconds) I T Min Max Average Min Max Average 5 5 0.74 4.68 1.97 3.451 4.623 3.801 10 1.64 5.58 2.90 6.547 7.623 6.978 15 1.20 6.34 3.10 8.835 10.17 9.328 10 5 0.54 2.05 1.04 4.820 7.472 5.458 10 0.80 3.41 1.56 8.440 11.185 9.301 15 0.95 4.43 2.13 15.801 24.315 17.021 25 5 0.31 1.01 0.67 10.826 14.086 12.167 10 0.46 2.33 1.34 21.762 23.010 22.408 15 0.62 4.13 1.97 33.017 53.115 37.775 50 5 0.33 0.66 0.47 13.875 30.773 25.099 10 0.55 1.87 1.33 44.053 62.554 48.422 15 0.53 117.98 9.62 65.901 87.031 71.839From Table1, we can see that our solution approach can present near optimal solutions for most of the instances with different sizes, and the gap between the relaxed upper bound and the feasible lower bound is controlled in 0.1% expected for some large scale instances with 50 products and 15 periods. Then we checked the computational results for all the one hundred large scale instances for 50 products and 15 periods and found that only 4 instances’ gaps are over 0.1% and reach about 1%, while the other 96 instances’ gaps are all below 0.1%. Also, the computational time of the proposed approach is short, and it is no more than 90 seconds even for the large scale instances with 50 products and 15 periods. Thus, the overall performance of the solution approach is good enough and can be used to solve most instances in practical business.In order to further illustrate the multiproduct multiperiod production planning problem with market effort, we present a two-product ten-period numerical example. The main parameters are presented in Table2, and the demands for both products in all periods are assumed to follow normal distribution. And the initial goodwill for both products is set to zero.Table 2
Main parameters for the numerical example.
Product Parameters p i c i g i t s i t a i α i t β i t δ i 1 120 48 48 6 1.5 260 50 0.2 2 180 72 72 9 2.5 180 40 0.3There are usually two typical capacity strategies in production planning: dynamic capacity and fixed capacity. In the dynamic capacity strategy, the production capacity is prepared according to the market demand forecast in the planning horizon and the capacity is different in different periods. In the fixed strategy, the production capacity is the same for all periods and the demand is satisfied through adjusting inventory strategy. In the numerical example, we let the overall capacity for the planning horizon be 46,180, while the capacity in each period is allocated according to dynamic and fixed strategies, respectively, which is illustrated in Table3.Table 3
Capacities in each period under different capacity allocation strategies.
Strategy Period 1 2 3 4 5 6 7 8 9 10 Dynamic capacity 2733 3847 4633 5164 5491 5642 5632 5455 5098 2487 Fixed capacity 4618 4618 4618 4618 4618 4618 4618 4618 4618 4618The example is solved under both capacity strategies. Figure1 presents the production decisions for the two products in all periods under dynamic capacity strategy, while Figure 2 presents the production decisions under the fixed capacity strategy. It can be seen that the production strategy follows an increasing-decreasing pattern when the capacity strategy is dynamic and follows an increasing-steady-decreasing pattern when the capacity strategy is fixed.Figure 1
The production decisions under dynamic capacity strategy.Figure 2
The production decisions under fixed capacity strategy.Figure3 presents the advertising decisions for the two products in all periods under dynamic capacity strategy, while Figure 4 presents the production decisions under the fixed capacity strategy. We can see that the advertising intensity follows a decreasing pattern for both dynamic and fixed capacity strategies. However, the advertising intensity decreases more quickly under the fixed capacity strategy.Figure 3
The advertising decisions under dynamic capacity strategy.Figure 4
The advertising decisions under fixed capacity strategy.The overall profit under the dynamic capacity strategy is 1,121,774.78, while the profit under fixed capacity strategy is 1,104,022.82. Thus, when the total production capacity is constant, the overall profit can be increased by about 1.61% if the capacity is dynamically allocated among periods. For firms with huge markets, even one percentage increasing on profit would mean millions of dollars.We further examine the reasons for causing these differences between dynamic and fixed capacity strategies. The actual consumption of production capacity under both strategies is presented in Figure5. In the first three periods, the goodwill for the products accumulates due to the investment on advertisement and thus the demands increase from lower level. We found that the production capacities are all utilized for the dynamic strategy while some capacities are not used for the fixed strategy in the first three periods. In the middle periods from 4 to 9, all capacities are sufficiently utilized under both dynamic and fixed strategies. However, as the dynamic strategy allocates more capacity in these periods and allows producing more quantities of products, more advertisement should be invested to promote more demands. That is why the advertising intensity under dynamic strategy (shown in Figure 3) is higher than that under fixed strategy (shown in Figure 4). In the last period, the capacity is also not sufficiently used for the fixed strategy. From the analysis, we can see that some production capacities are not utilized under the fixed capacity strategy, and these capacities would not generate any profit.Figure 5
The actual consumption of production capacity under dynamic and fixed strategies.


## 5. Conclusion

Production/inventory management and dynamic advertisement are both important to the firms’ operation. The presented study expands the literature on the integration of production planning and marketing efforts. Through the incorporation of classical newsvendor model with the N-A model, a nonlinear programming formulation is presented for the multiproduct multiperiod production planning problem with marketing effort. In the proposed model, the demand is assumed to be uncertain and depend on the accumulated investment on advertisement. Due to the computational complexity of the model, the Lagrangian relaxation and decomposition are employed to calculate the upper bound of the problem. We utilize the subgradient algorithm to search a tight upper bound of the model and a heuristic algorithm to find a feasible lower bound. Test results for hundreds of randomly generated instances show that the Lagrangian based solution approach can present very good solutions in short CPU time.There are several future research directions for this paper. In this study, we considered the single budget constraint in each period, and one of the immediate extensions is to consider multiple capacity constraints in the production process. Also, we assume the demand linearly depends on the goodwill of customers on the product, while their relationship may be nonlinear in some situations. Thus, a fruitful avenue for future research is to consider other forms of demand functions, such as nonlinear forms,Dit=αit1-e-βitGit, which is also widely used in literatures [30]. We use the N-A advertising model to capture the accumulating impact of advertisement, while there are some other advertising models in literature, such as Vidale-Wolfe model and the Bass diffusion model [24]. It would be also important to investigate the incorporation of production management model with other advertising models in future.



---

*Source: 7674027-2016-10-20.xml*