Next Article in Journal
An Analytical Solution for Non-Linear Viscoelastic Impact
Next Article in Special Issue
Optimization of the Real-Time Response to Roadside Incidents through Heuristic and Linear Programming
Previous Article in Journal
Asymptotic Stability of Solutions to a Class of Second-Order Delay Differential Equations
Previous Article in Special Issue
Production/Inventory Policies for a Two-Echelon System with Credit Period Incentives
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimal Price and Lot Size for an EOQ Model with Full Backordering under Power Price and Time Dependent Demand

by
Luis A. San-José
1,2,*,
Joaquín Sicilia
3,
Manuel González-de-la-Rosa
4 and
Jaime Febles-Acosta
4
1
IMUVA-Mathematics Research Institute, University of Valladolid, 47011 Valladolid, Spain
2
Department of Applied Mathematics, University of Valladolid, 47011 Valladolid, Spain
3
Department of Mathematics, Statistics and Operational Research, University of La Laguna, 38200 San Cristóbal de La Laguna, Spain
4
Department of Business Administration and Economic History, University of La Laguna, 38200 San Cristóbal de La Laguna, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(16), 1848; https://doi.org/10.3390/math9161848
Submission received: 18 June 2021 / Revised: 28 July 2021 / Accepted: 2 August 2021 / Published: 5 August 2021

Abstract

:
In this paper, we address an inventory system where the demand rate multiplicatively combines the effects of time and selling price. It is assumed that the demand rate is the product of two power functions, one depending on the selling price and the other on the time elapsed since the last inventory replenishment. Shortages are allowed and fully backlogged. The aim is to obtain the lot sizing, the inventory cycle and the unit selling price that maximize the profit per unit time. To achieve this, two efficient algorithms are proposed to obtain the optimal solution to the inventory problem for all possible parameter values of the system. We solve several numerical examples to illustrate the theoretical results and the solution methodology. We also develop a numerical sensitivity analysis of the optimal inventory policy and the maximum profit with respect to the parameters of the demand function.

1. Introduction

Inventory Theory collects a set of mathematical models which describe the properties of a wide variety of inventory systems, and studies different methodologies to seek and analyze the best strategies that may be applied in the management of inventories. In the literature on inventory models, the demand rate of items is often assumed to be constant and known, independent of the time elapsed since the last replenishment. Thus, Chung et al. [1] provide the optimal solution for an inventory model with lot-size-dependent trade credit under delayed payment, cash discount and constant demand rate. Vandana and Sharma [2] developed an inventory model with constant demand, partial backlogging and partial permissible delay-in-payment. Mokhtari [3] proposed an economic order quantity model with constant demand to determine the joint ordering policy for two products under completion and substitution. Other recent papers considering constant demand are the following: Lin et al. [4], Chung et al. [5], Khakzad and Gholamian [6] and Mishra et al. [7].
However, for some types of products, the demand rate often depends on time or/and other characteristics. For this reason, in this paper, we develop an inventory model to determine the optimal policy for products in which demand depends on time and the selling price of the item. Thus, the demand rate is the product of a power time-function and a decreasing price-function. This price-function is a power-function that depends on several parameters and represents the relation between demand and the unit selling price. The power time-dependent demand pattern was introduced by Naddor [8] and, since then, several papers have appeared in the literature with this type of demand. Among others, we can cite the papers of Datta and Pal [9], Lee and Wu [10], Rajeswari and Vanjikkodi [11], Mishra et al. [12], Singh and Kumar [13], Mishra and Singh [14] and Rajeswari and Indrani [15]. A common characteristic of all the above papers is that the length of the inventory cycle is fixed. Later on, Sicilia et al. [16,17], San-José et al. [18], Adaraniwon and Omar [19,20] and San-José et al. [21] developed inventory systems with a power demand pattern in which the inventory cycle is not fixed and is, therefore, a decision variable of the inventory problem. Demand rate as a separable function of time and the selling price was also introduced in some articles on inventory management. Thus, the papers developed by Smith et al. [22], Soni [23], Wu et al. [24], Avinadav et al. [25], San-José et al. [26] and Pando et al. [27] considered this assumption.
In some real inventory systems, it may be more advantageous for the firm that the customers have to wait a time period until the arrival of the next replenishment to receive their orders. Thus, in this paper, we assume that shortages are allowed and completely backordered. That is, any customer arriving in the stock-out period is willing to wait for the next replenishment. This hypothesis of full backordering is also considered in other papers (see, e.g., San-José and García-Laguna [28], Birbil et al. [29], Jakic and Fransoo [30], Mishra et al. [31] and San-José et al. [32]).
In the inventory literature, we know of no papers on inventory systems that simultaneously assume the following characteristics: demand rate is the product of a time-dependent power demand and a price-dependent power demand, shortages are completely backordered and the length of the inventory cycle is a decision variable. The inventory system studied here is based on these assumptions. The objective function to optimize is the profit per unit time. This profit is calculated by the difference between the revenue from product sales and the sum of ordering cost, purchasing cost, holding cost and backordering cost. The aim is to determine the optimal inventory policy (the economic lot size and optimal inventory cycle) and the optimal selling price that maximize the total profit per unit time. Under the above considerations, a new approach is developed for determining the optimal policy and the best selling-price of the product, taking into account the values of the parameters considered in the inventory system.
The outline of the paper is described below. Section 2 specifies the hypothesis of the model and the notation used in the rest of the work. Section 3 presents the mathematical formulation, including the calculation of costs related to the management of the inventory system and the establishment of the profit function per unit of time. Section 4 studies some properties of the objective function and develops algorithmic procedures that allow to determine the optimal inventory policy for the two different situations that can occur. In Section 5, we introduce some numerical examples to illustrate the application of the optimization procedures. Moreover, we also give a numerical sensitivity analysis for the best selling price, the optimal inventory policy and maximum profit with respect to the parameters of the demand rate function. Finally, in Section 6, we provide the conclusions of this paper and possible future research directions in this area.

2. Hypothesis and Notation

The inventory system analyzed in this work has the following properties:
  • The inventory system considers a single item.
  • Inventory control is performed through a continuous review system.
  • The replenishment period is negligible or null.
  • The planning horizon is infinite.
  • The lead-time is zero.
  • The inventory is scheduled each T time unit. It is a decision variable.
  • The cost of placing an order is constant and independent of the size of the order.
  • The unit purchasing cost is known and constant.
  • The unit selling price is unknown and it is a decision variable.
  • The unit holding cost is a linear function of the time that the article remains in the store.
  • Shortages are allowed and completely backlogged.
  • The unit cost of shortage is a linear function of the time that elapses until the item is received.
  • The inventory is replenished when the number of backorders is equal to s quantity units. That is, the reorder level is s.
  • The replenishment size Q raises the inventory at the beginning of each scheduling period to the order level S.
  • Demand D ( t , p ) is a function that depends on time and the selling price of the item. It is assumed that
    D ( t , p ) = D 1 ( t ) D 2 ( p ) ,
    that is, demand combines the effects of time and the selling price in a multiplicative way.
In this paper, it is assumed that D 1 ( t ) is a power function given by
D 1 ( t ) = 1 n t T 1 / n 1 , 0 < t < T
with index n > 0 , and D 2 ( p ) is a decreasing power function given by
D 2 ( p ) = α β p γ , with α > 0 , β > 0 and γ > 0 .
The parameter α represents the market size and the parameters β and γ are the coefficients related to the sensibility of demand with respect to the unit selling price. As D ( t , p ) 0 , then the maximum unit selling price is
p m = α β 1 / γ
Note that the demand patterns represent the different ways by which quantities are taken out of inventory to fill customer demand. Given p, the function D ( t , p ) is known as the power demand pattern. Depending on the value of the index n, that function D ( t , p ) may represent several ways in which demand occurs during an inventory cycle (see, e.g., Naddor [8], Mishra et al. [12], Singh and Kumar [13], Rajeswari and Indrani [15], Sicilia et al. [16,17], and San-José et al. [18,21,32]). Thus, if n > 1 , then this means that demand is large at the beginning of the scheduling period and then declines throughout the inventory cycle. If n = 1 , the demand is constant throughout the scheduling period. Finally, if n < 1 , then demand is very low at the beginning of the scheduling period and then increases throughout the inventory cycle, reaching the highest demand at the end of the cycle.
Figure 1, Figure 2 and Figure 3 plot the demand rate function D ( t , p ) for different values of the parameters γ and n.
The notation used throughout this work is shown in Table 1.
In the next section, we determine the inventory level function I ( t , p ) , which describes the evolution of the net inventory, and the costs related to the inventory system.

3. Formulation of the Mathematical Model

The fluctuation of the inventory level during the inventory cycle T is as follows: At the beginning of the scheduling period, there are S units in stock. That amount decreases due to demand during the interval ( 0 , ϕ ] and drops to zero at t = ϕ . Thus, we have
S = 0 ϕ D ( t , p ) d t .
Next, during the interval [ ϕ , T ] , the inventory level decreases continuously due to the effect of customer demand. During this period there is no stock, shortages occur and demand is backlogged. When the on-hand inventory level is equal to s (reorder point), a new replenishment is added to the inventory and a new inventory cycle begins. Hence, the inventory level at any instant of time t during [ 0 , T ] is described by
I ( t , p ) = S 0 t D ( t , p ) d t = D 2 ( p ) t ϕ D 1 ( t ) d t .
From (1) and (2), substituting the functions D 1 ( t ) and D 2 ( p ) into (5), we have
I ( t , p ) = α β p γ T ϕ T 1 / n t T 1 / n = S α β p γ T t T 1 / n .
As at point t = 0 the inventory level is equal to S, then we have
S = α β p γ T ϕ T 1 / n
Also, at the point t = T , the inventory level coincides to the reorder point, that is, s = I ( T , p ) . Hence, we obtain
s = I ( T , p ) = α β p γ T ϕ T 1 / n 1 .
The lot size Q is equal to S s . Thus, from (7) and (8), we have
Q =   α β p γ T .

The Objective Function

Let G ( S , T , p ) be the profit per unit time. That profit is equal to the revenues per cycle ( p Q ) minus the sum of the costs related to the inventory management. These costs are the purchasing cost ( c Q ), the ordering cost (A), the holding cost ( H C ) and the shortage cost ( S C ). The holding cost is given by
H C = h 0 ϕ I ( t , p ) d t = h n + 1 S T S α β p γ T n
and the shortage cost is
S C = π ϕ T I ( t , p ) d t = π n n + 1 α β p γ T 2 S T + 1 n + 1 S T S α β p γ T n .
Hence, the profit per time unit is given by
G ( S , T , p ) = 1 T ( p c ) Q A h 0 ϕ I ( t , p ) d t + π ϕ T I ( t , p ) d t = ( p c ) α β p γ A T h + π n + 1 S S α β p γ T n n n + 1 π α β p γ T + π S
Our goal is to determine the values of the decision variables S, T and p that maximize the profit G ( S , T , p ) per unit time, subject to the constraints T > 0 , 0 S   α β p γ T and c p p m , with p m given by (3).

4. Analysis of the Inventory Problem

It is easy to check that, for a fixed p, the function G ( S , T , p ) is strictly concave and has a maximum point ( S * ( p ) , T * ( p ) ) determined by
S * ( p ) = π h + π 1 / n α β p γ ( n + 1 ) A n α β p γ π 1 π h + π 1 / n
T * ( p ) = ( n + 1 ) A n α β p γ π 1 π h + π 1 / n
Thus, given p, the optimum profit per unit time is
B ( p ) = G ( S * ( p ) , T * ( p ) , p ) = ( p c ) α β p γ 2 α β p γ θ ,
where the auxiliary parameter θ is given by
θ = n n + 1 A π 1 π h + π 1 / n .
The function B ( p ) has the following properties:
(i)
B ( p ) is continuous on the interval [ c , p m ] . Moreover, B ( c ) < 0 and B ( p m ) = 0 .
(ii)
B ( p ) is differentiable and its derivative is
B ( p ) = α + β p γ 1 γ c + γ θ α β p γ ( γ + 1 ) p = β p γ 1 α β p 1 γ + γ c + γ θ α β p γ ( γ + 1 ) p
(iii)
Sign ( B ( p ) ) = sign ( f ( p ) ) , where the function f ( p ) is defined by
f ( p ) = γ c ( γ + 1 ) p + α β p 1 γ + γ θ α β p γ .
Thus, the maximum of the function B ( p ) can be found by analyzing the function f ( p ) . For that, we calculate the two first derivatives of the function f ( p ) :
f ( p ) = ( γ + 1 ) + α β 1 γ p γ + β γ 2 θ p γ 1 2 α β p γ 3
and
f ( p ) = γ 1 α γ β p γ + 1 + α β γ 2 θ p γ 2 2 α β p γ 5 + γ + 2 β 2 γ 2 θ p 2 γ 1 4 α β p γ 5 .
Next, we study separately two scenarios: when γ 1 and when 0 < γ < 1 .

4.1. Optimum Solution for the Case γ 1

In this scenario the function f ( p ) is strictly convex. Thus, the optimum value of the unit selling price p is determined by the following result.
Theorem 1.
Let B ( p ) , f ( p ) and f ( p ) be the functions given by (15), (18) and (19), respectively. When γ 1 , the optimal inventory policy is as follows:
1. 
If f ( c ) is non-negative, then the optimum unit selling price is p * = p m and the maximum profit per unit time is B * = B ( p * ) = 0 .
2. 
Otherwise f ( c ) < 0 , let p 1 = arg p ( c , p m ) { f ( p ) = 0 } .
(a) 
If f ( p 1 ) 0 , then p * = p m and B * = B ( p m ) = 0 .
(b) 
If f ( p 1 ) < 0 , then to let p 0 = arg p ( c , p 1 ) { f ( p ) = 0 } .
i. 
If B ( p 0 ) < 0 , then p * = p m and B * = B ( p * ) = 0 .
ii. 
If B ( p 0 ) 0 , then p * = p 0 and the maximum profit per unit time is B * = B ( p 0 ) = ( p 0 c ) α β p 0 γ 2 θ α β p 0 γ .
Proof. 
Please see the proof in the Appendix A. □
Remark 1.
From Theorem 1, the optimal selling price p * when γ 1 is either p m or p 0 = arg p ( c , p 1 ) { f ( p ) = 0 } . This optimum price p * depends whether the values f ( c ) , f ( p 1 ) and B ( p 0 ) are positive or not.
Taking into account Theorem 1, the following algorithmic procedure gives the optimal inventory policy when γ 1 .

4.2. Optimum Solution for the Case 0 < γ < 1

Consider now the scenario where 0 < γ < 1 . In this case, the curvature of the function f ( p ) is unknown. For that, we have to study the behavior of the derivative of the function f ( p ) .
Lemma 1.
The function f ( p ) given by (19) is strictly convex.
Proof. 
Please see the Appendix A. □
Note that if 0 < γ < 1 , then the function f ( p ) has at most two zeros. Therefore, the function f ( p ) has at most two local extreme points in the interval ( c , p m ) . Taking into account this property, the optimal inventory policy when 0 < γ < 1 is presented in the following result.
Theorem 2.
Let B ( p ) , f ( p ) , f ( p ) and f ( p ) be the functions given by (15), (18)–(20), respectively. Suppose that 0 < γ < 1 . The optimal inventory policy is as follows:
1. 
If f ( c ) 0 and f ( c ) 0 , then the optimum unit selling price is p * = p m and the maximum profit is B * = B ( p m ) = 0 .
2. 
If f ( c ) 0 and f ( c ) < 0 , then to let p 2 = arg p ( c , p m ) { f ( p ) = 0 } .
(a) 
If f ( p 2 ) 0 , then p * = p m and B * = B ( p m ) = 0 .
(b) 
If f ( p 2 ) < 0 , then to let p 3 = arg p ( c , p 2 ) { f ( p ) = 0 } and
p 4 = arg p ( p 2 , p m ) { f ( p ) = 0 } .
i. 
If f ( p 4 ) 0 , then p * = p m and B * = B ( p m ) = 0 .
ii. 
If f ( p 4 ) < 0 , then to let p 5 = arg p ( p 3 , p 4 ) { f ( p ) = 0 } .
(A)
If B ( p 5 ) < 0 , then p * = p m and B * = B ( p m ) = 0 .
(B)
If B ( p 5 ) 0 , then p * = p 5 and the maximum profit is given by B * = B ( p 5 ) = p 5 c ) α β p 5 γ 2 θ α β p 5 γ .
3. 
If f ( c ) < 0 , then to let p 1 = arg p ( c , p m ) { f ( p ) = 0 } .
(a) 
If f ( p 1 ) 0 , then p * = p m and B * = B ( p m ) = 0 .
(b) 
If f ( p 1 ) < 0 , let p 0 = arg p ( c , p 1 ) { f ( p ) = 0 } .
i. 
If B ( p 0 ) < 0 , then p * = p m and B * = B ( p m ) = 0 .
ii. 
If B ( p 0 ) 0 , then p * = p 0 and the maximum profit is B * = B ( p 0 ) = ( p 0 c ) α β p 0 γ 2 θ α β p 0 γ .
Proof. 
Please see Appendix A. □
Remark 2.
From Theorem 2, the optimal selling price p * when 0 < γ < 1 is p m , p 0 = arg p ( c , p 1 ) { f ( p ) = 0 } , or p 5 = arg p ( p 3 , p 4 ) { f ( p ) = 0 } . This optimum price p * is conditioned by the sign of the values f ( c ) , f ( c ) , f ( p 1 ) , f ( p 4 ) , f ( p 2 ) , B ( p 0 ) and B ( p 5 ) .
The following algorithmic approach determines the optimum inventory policy when 0 < γ < 1 .
Remark 3.
Note that if p * = p m , then the inventory system is unprofitable.

4.3. Particular Models

In this subsection, we comment that some models studied by other authors are specific cases from the model proposed in this paper.
(1)
If we consider β 0 , then we have the inventory model with power demand pattern and full backlogging analyzed by Sicilia et al. [16].
(2)
If we assume that n = 1 and β 0 , then the inventory problem is reduced to max 0 b Q Q > 0 G 0 ( Q , b ) = ( p c ) α A α Q h ( Q b ) 2 2 Q π b 2 2 Q , where b = s , that is, we derive to the EOQ model with full backordeing (see, e.g., Axsäter [33], p. 31).
(3)
Considering that n = 1 , γ = 1 and π , we derive using the models developed by Smith et al. [22], and Kunreuther and Richard [34] when a linear demand is assumed. Besides, the optimal policy determined by Algorithm 1 is equal to the “simultaneous solution” proposed by the cited authors.
(4)
Also, when n = 1 , γ = 1 and π , we obtain the model studied by Kabirian [35] if we suppose that the demand rate is constant, the production cost is fixed and the production rate is infinite.
Algorithm 1  Obtaining the optimal policy and the maximum profit when γ 1             
Step 1From (19), calculate f ( c ) .
Step 2If f ( c ) 0 , then go to step 8. Otherwise, go to step 3.
Step 3Obtain p 1 = arg p ( c , p m ) { f ( p ) = 0 } .
Step 4If f ( p 1 ) 0 , then go to step 8. Otherwise, go to step 5.
Step 5Calculate p 0 = arg p ( c , p 1 ) { f ( p ) = 0 } .
Step 6If B ( p 0 ) < 0 , then go to step 8. Otherwise, go to step 7.
Step 7Set p * = p 0 . From (13), calculate S * = S * ( p * ) .
From (14), get T * = T * ( p * ) .
From (15), determine B * = B ( p * ) . Stop.
Step 8Set p * = p m . Put B * = 0 , S * = 0 and T * = . Stop.

5. Numerical Examples

In this section, several numerical examples are presented to illustrate the theoretical results previously developed.
Example 1.
Suppose an inventory system for a single item with the same properties as those described in Section 2. Consider the following parameters: purchasing cost c = $ 8 per unit, ordering cost A = $ 500 per order, unit holding cost h = $ 2 per unit and month, shortage cost π = $ 3.2 per unit and month, and the index of the power demand pattern n = 2.5 . In addition, the demand rate per month is a function dependent on p which is fitted to the expression D 2 ( p ) = α β p γ , with the parameters α = 1280 , β = 40 and γ = 1.25 . Firstly, the maximum unit selling price p m = $ 16 per unit has to be calculated. Applying step 1 of Algorithm 1, we have f ( c ) = 2.80766 < 0 . Next, the point p 1 = arg p ( 8 , 16 ) { f ( p ) = 0 } = 15.5006 is calculated. Also, f ( p 1 ) = 6.23179 < 0 and, from step 5, we have p 0 = arg p ( 8 , p 1 ) { f ( p ) = 0 } = 12.4417 . As B ( p 0 ) = 1005.97 > 0 , it is deduced that the optimum unit selling price is p * = p 0 = $ 12.4417 per unit and the maximum profit is B * = B ( p 0 ) = $ 1005.97 per month. From (13), the maximum inventory level is S * = 538.721 units and, from (14), the optimum inventory cycle is T * = 1.89441 months. Therefore, the economic lot size is Q * = 654.192 units. Figure 4 shows the functions f ( p ) and B ( p ) of this numerical example.
Example 2.
Assume the same parameters as in Example 1, but now the values of c and α are changed to c = $ 6.25 per unit and α = 640 , respectively. Then the maximum unit selling price is p m = $ 9.18959 per unit. From step 1 of Algorithm 1, f ( c ) = 2.47145 . From step 3, it follows that p 1 = 8.66838 . As f ( p 1 ) = 0.278539 > 0 , it can be concluded that, for any unit selling price, the inventory system cannot be profitable.
Example 3.
Assume the same parameters as Example 1, except for the values of β and γ. Now, assume that these parameters are β = 80 and γ = 0.8 . The value of p m is now p m = $ 32 per unit. As 0 < γ < 1 , then the steps of Algorithm 2 are followed to find the optimal inventory policy. Thus, we have f ( c ) = 1.18416 < 0 , p 1 = arg p ( 8 , 32 ) { f ( p ) = 0 } = 31.2652 , f ( p 1 ) = 15.6852 , p 0 = arg p ( 8 , p 1 ) { f ( p ) = 0 } = 20.0649 and B ( p 0 ) = 4245.02 . Consequently, the optimum unit selling price is p * = p 0 = $ 20.0649 per unit, the inventory level is S * = 578.982 units, the inventory cycle is T * = 1.76268 months, the economic lot size is Q * = 703.082 units and the maximum profit per unit time is B * = $ 4245.02 per month. The functions f ( p ) and B ( p ) are shown in Figure 5.
Algorithm 2  Obtaining the optimal policy and the maximum profit when 0 < γ < 1     
Step 1Calculate f ( c ) from (19).
If f ( c ) < 0 , then go to step 6. Otherwise, go to step 2.
Step 2From (20), obtain f ( c ) .
If f ( c ) 0 , then go to step 8. Otherwise, go to step 3.
Step 3Calculate p 2 = arg p ( c , p m ) { f ( p ) = 0 } .
If f ( p 2 ) 0 , then go to step 8. Otherwise, go to step 4.
Step 4Calculate the points p 3 = arg p ( c , p 2 ) { f ( p ) = 0 } and p 4 =
arg p ( p 2 , p m ) { f ( p ) = 0 } .
If f ( p 4 ) 0 , then go to step 8. Otherwise, go to step 5.
Step 5Calculate p 5 = arg p ( p 1 , p 4 ) { f ( p ) = 0 } .
If B ( p 5 ) < 0 , then go to step 8. Otherwise, take p * = p 5 and go to step 9.
Step 6Calculate p 1 = arg p ( c , p m ) { f ( p ) = 0 } .
If f ( p 1 ) 0 , then go to step 8. Otherwise, go to step 7.
Step 7Calculate p 0 = arg p ( c , p 1 ) { f ( p ) = 0 } .
If B ( p 0 ) < 0 , then go to step 8. Otherwise, take p * = p 0 and go to step 9.
Step 8Set p * = p m . Put B * = 0 , S * = 0 and T * = . Stop.
Step 9From (13), calculate S * = S * ( p * ) .
From (14), calculate T * = T * ( p * ) .
From (15), determine B * = B ( p * ) . Stop.
Example 4.
Consider the same parameters as in Example 3, but changing the unit purchasing cost to c = $ 2 per unit. Following Algorithm 2, we have f ( c ) = 0.0461332 , f ( c ) = 0.735387 , p 2 = 24.0160 , f ( p 2 ) = 1.50313 , p 3 = 2.06455 , p 4 = 31.2652 , f ( p 4 ) = 20.4852 , p 5 = 16.7939 and B ( p 5 ) = 6985.45 . Therefore, the optimal unit selling price is p * = p 5 = $ 16.7939 per unit, the inventory level is S * = 658.394 units, the inventory cycle is T * = 1.55008 months, the economic lot size is Q * = 799.517 units and the profit per unit time is B * = $ 6985.45 per month. The functions f ( p ) and B ( p ) are plotted in Figure 6.

Sensitivity Analysis

To analyze the effect of the parameters of the demand rate α , β , γ and n on the optimal policy and the maximum profit, three tables are presented where the evolution of the optimal policy p * , T * , S * and the maximum profit B * is shown for different values of α , β , γ and n. We assume the parameters c = 8 , A = 500 , h = 2 and π = 3.2 . Table 2, Table 3 and Table 4 display computational results where α { 960 , 1280 , 1600 } , β { 36 , 40 , 44 , 48 } , γ { 0.8 , 0.9 , 1 , 1.1 , 1.2 } and n { 0.5 , 1 , 2 } . The obtained results can help us to identify some insights into the model presented in this paper. These characteristics are noted below:
1.
When β , γ and n are fixed, the optimal selling price p * , the optimal maximum inventory level S * and the maximum profit per unit time B * increase as the parameter α increases. However, the optimal inventory cycle T * decreases as α increases.
2.
With fixed α , γ and n, if the value of β is increasing, then there is a point β ^ such that p * ( β ) < p m and B ( p * ( β ) ) > 0 for all β < β ^ , and p * ( β ) = p m and B ( p * ( β ) ) = 0 if β β ^ . Moreover, when β < β ^ , the optimal unit selling price, the maximum inventory level and the optimal profit are all strictly decreasing as the parameter β increases, while the optimal inventory cycle is strictly decreasing as the parameter β increases.
3.
With fixed α , β and n, if the value of γ is increasing, then there is a point γ ^ such that p * ( γ ) < p m and B ( p * ( γ ) ) > 0 for all γ < γ ^ , and p * ( γ ) = p m and B ( p * ( γ ) ) = 0 if γ γ ^ . Moreover, when γ < γ ^ , the optimal unit selling price, the maximum inventory level and the optimal profit are all strictly decreasing as the parameter γ increases. However, the optimal inventory cycle is strictly decreasing as the parameter γ increases.
4.
With fixed α , β and γ , if the index of the power demand pattern n is increasing, then there is a point n ^ such that p * ( n ) < p m and B ( p * ( n ) ) > 0 for all n > n ^ , and p * ( n ) = p m and B ( p * ( n ) ) = 0 if n < n ^ . Moreover, when n > n ^ , the optimal unit selling price, the maximum inventory level and the optimal profit are all strictly decreasing as the parameter n increases. However, the optimal inventory cycle is strictly decreasing as the parameter n increases.
5.
The optimal inventory policy and the maximum unit selling price are not very sensitive to changes in the demand pattern index n. However, the optimal solution is quite sensitive to changes in the value of γ .
Next, we present some findings obtained from the sensitivity analysis. Thus, the modification of the parameter α associated with the price-dependent demand has a greater effect on the total profit per unit time in a positive way, more so than the variation of the sensibility parameter β for the price-dependent demand. Therefore, the decision maker should boost the price-dependent demand by implementing policies that increase the parameter α of the demand rate (for example, applying some marketing policies such as quantity discount).

6. Conclusions

We have studied an inventory model where demand depends on time and the unit selling price. Shortages are allowed and completely backlogged. The objective is to maximize the profit per unit time, assuming that the profit is the difference between revenue obtained from product sales and the total inventory cost. This cost is the sum of the ordering, purchasing, holding and backordering costs.
We introduce an approach to determine the optimal inventory policy, the optimal selling-price and the maximum profit per unit time in all possible cases. In order to illustrate the theoretical results and the methodology developed for obtaining the optimal solution of the inventory problem, we have presented some numerical examples where the optimal inventory policies are determined following the steps described in the proposed algorithms.
To analyze the effect on the optimal policy of changes in the parameters associated with the demand rate, we present several computational results that allow us to carry out a sensitivity analysis of the inventory policy.
Future research lines related to this paper could be the following: (i) to study the inventory system for perishable items, considering the properties established in this paper; (ii) to analyze the same system assuming stochastic demand; and (iii) to consider partial backordering in the assumptions of the inventory system.

Author Contributions

Conceptualization, L.A.S.-J., J.S., M.G.-d.-l.-R. and J.F.-A.; Methodology, L.A.S.-J., J.S., M.G.-d.-l.-R. and J.F.-A.; writing—review & editing, L.A.S.-J., J.S., M.G.-d.-l.-R. and J.F.-A. All authors have read and agreed to the published version of the manuscript.

Funding

This work is partially supported by the Spanish Ministry of Science, Innovation and Universities through the research project MTM2017-84150-P, which is co-financed by the European Community under the European Regional Development Fund (ERDF).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Proof of Theorem 1.
Since γ 1 , from (20) it follows that the function f ( p ) is strictly convex. Taking into account that f ( c ) = ( α β c γ ) β c 1 γ + γ θ α β c γ > 0 and lim p p m f ( p ) = , we consider the following cases:
  • If f ( c ) 0 , then f ( p ) is a strictly increasing function and, therefore, positive on the interval [ c , p m ) . In consequence, the function B ( p ) is also strictly increasing. Thus, it attains its maximum value at p * = p m .
  • It f ( c ) < 0 , let p 1 be the point where the function f ( p ) attains its minimum value, that is, p 1 = arg p ( c , p m ) { f ( p ) = 0 } (this point is unique, because f is strictly convex with lim p p m f ( p ) = ). We have two possibilities:
    (a)
    If f ( p 1 ) 0 , then f ( p ) > 0 on the set [ c , p 1 ) ( p 1 , p m ) and, therefore, B ( p ) is a strictly increasing function. Then it attains its maximum value at p * = p m .
    (b)
    If f ( p 1 ) < 0 , then f ( p ) has two roots in the interval [ c , p m ) : p 0 ( c , p 1 ) and p ˜ ( p 1 , p m ) . So f ( p ) > 0 on the set [ c , p 0 ) ( p ˜ , p m ) and f ( p ) < 0 on the interval ( p 0 , p ˜ ) . Thus, the function B ( p ) is strictly increasing on the interval [ c , p 0 ) , strictly decreasing on ( p 0 , p ˜ ) and strictly increasing on ( p ˜ , p m ) . Therefore, B ( p ) attains its maximum value at p 0 or at p m . Finally, considering that B ( p m ) = 0 , the conclusion of the theorem is obtained.
 □
Proof of Lemma 1.
The proof is immediate, because
f ( p ) = 1 γ 2 α γ β p γ + 2 + β γ 2 θ p γ 3 8 α β p γ 7 g ( p γ ) ,
where g ( x ) is a positive parabolic function given by
g ( x ) = β 2 ( γ + 2 ) ( γ + 4 ) x 2 + 2 α β ( γ 1 ) ( 5 γ + 8 ) x + 4 α 2 ( γ 1 ) ( γ 2 ) .
 □
Proof of Theorem 2.
Taking into account the result of Lemma 1, we have that f ( p ) is a strictly convex function and lim p p m f ( p ) = . Next, we consider the following two situations depending on the value of f ( c ) :
  • If f ( c ) 0 , then the following three cases can occur:
    (a)
    If f ( c ) 0 , then the function f ( p ) is strictly increasing for p ( c , p m ) and, since f ( c ) 0 , it is positive on such an interval. Therefore, f ( p ) is a strictly increasing and positive function. Hence, the function B ( p ) is strictly increasing. Then, it attains its maximum value at p * = p m .
    (b)
    If f ( c ) < 0 , then the function f ( p ) has a root p 2 in the interval ( c , p m ) , because lim p p m f ( p ) = . We have two possibilities:
    i.
    If f ( p 2 ) 0 , then f ( p ) > 0 on the set ( c , p 2 ) ( p 2 , p m ) . Thus, f ( p ) is a positive and strictly increasing function. Hence, the function B ( p ) is strictly increasing. Then it attains its maximum value at p * = p m .
    ii.
    If f ( p 2 ) < 0 , the function f ( p ) has two zeros in the interval ( c , p m ) : p 3 ( c , p 2 ) and p 4 ( p 2 , p m ) , so that f ( p ) > 0 on the set [ c , p 3 ) ( p 4 , p m ] and f ( p ) < 0 on the interval ( p 3 , p 4 ) . That is, the function f ( p ) is strictly increasing on [ c , p 3 ) , strictly decreasing on ( p 3 , p 4 ) and strictly increasing on ( p 4 , p m ] . Now, two cases can occur:
    A.
    If f ( p 4 ) 0 , then the function f ( p ) is positive on the set ( c , p 4 ) ( p 4 , p m ) . Thus, the function B ( p ) attains its maximum value at p m .
    B.
    If f ( p 4 ) < 0 , then the function f ( p ) has two roots in the interval [ c , p m ) : p 5 ( p 3 , p 4 ) and p ˜ ( p 4 , p m ) . Besides, f ( p ) > 0 on [ c , p 5 ) ( p ˜ , p m ] and f ( p ) < 0 on ( p 5 , p ˜ ) . Thus, B ( p ) is strictly increasing on [ c , p 5 ) , strictly decreasing on ( p 5 , p ˜ ) and strictly increasing on ( p ˜ , p m ] . Therefore, its maximum value is attained at p 5 or at p m . Since B ( p m ) = 0 , the conclusion of the theorem is obtained.
  • If f ( c ) < 0 , then the function f ( p ) has a unique zero, p 1 , in the interval ( c , p m ) , so that f ( p ) < 0 on ( c , p 1 ) and f ( p ) > 0 on ( p 1 , p m ) . Evaluating the function f ( p ) at the point p 1 , we have the following two possibilities:
    (a)
    If f ( p 1 ) 0 , then f ( p ) is positive on ( c , p 1 ) ( p 1 , p m ) , because f ( c ) > 0 . Therefore, the function B ( p ) attains its maximum value at p * = p m .
    (b)
    If f ( p 1 ) < 0 , then f ( p ) has two roots in the interval [ c , p m ) : p 0 ( c , p 1 ) and p ˜ ( p 1 , p m ) , such that f ( p ) > 0 on the set [ c , p 0 ) ( p ˜ , p m ) and f ( p ) < 0 on the interval ( p 0 , p ˜ ) . The rest of the proof runs as in the case 1.b.ii.B.
 □

References

  1. Chung, K.J.; Lin, S.D.; Srivastava, H.M. The complete solution procedures for the mathematical analysis of some families of optimal inventory models with order-size dependent trade credit and deterministic and constant demand. Appl. Math. Comput. 2012, 219, 141–156. [Google Scholar] [CrossRef]
  2. Vandana; Sharma, B.K. An EOQ model for retailers partial permissible delay in payment linked to order quantity with shortages. Math. Comput. Simul. 2016, 125, 99–112. [Google Scholar] [CrossRef]
  3. Mokhtari, H. Economic order quantity for joint complementary and substitutable items. Math. Comput. Simul. 2018, 154, 34–47. [Google Scholar] [CrossRef]
  4. Lin, F.; Jia, T.; Wu, F.; Yang, Z. Impacts of two-stage deterioration on an integrated inventory model under trade credit and variable capacity utilization. Eur. J. Oper. Res. 2019, 272, 219–234. [Google Scholar] [CrossRef]
  5. Chung, K.J.; Liao, J.J.; Lin, S.D.; Chuang, S.T.; Srivastava, H.M. The inventory model for deteriorating items under conditions involving cash discount and trade credit. Mathematics 2019, 7, 596. [Google Scholar] [CrossRef] [Green Version]
  6. Khakzad, A.; Gholamian, M.R. The effect of inspection on deterioration rate: An inventory model for deteriorating items with advanced payment. J. Clean. Prod. 2020, 254, 120117. [Google Scholar] [CrossRef]
  7. Mishra, U.; Wu, J.Z.; Sarkar, B. A sustainable production-inventory model for a controllable carbon emissions rate under shortages. J. Clean. Prod. 2020, 256, 120268. [Google Scholar] [CrossRef]
  8. Naddor, E. Inventory Systems; John Wiley: New York, NY, USA, 1966. [Google Scholar]
  9. Datta, T.K.; Pal, A.K. Order level inventory system with power demand pattern for items with variable rate of deterioration. Indian J. Pure Appl. MatH. 1988, 19, 1043–1053. [Google Scholar]
  10. Lee, W.C.; Wu, J.W. An EOQ model for items with weibull distributed deterioration, shortages and power demand pattern. Int. J. Inform. Manag. Sci. 2002, 13, 19–34. [Google Scholar]
  11. Rajeswari, N.; Vanjikkodi, T. Deteriorating inventory model with power demand and partial backlogging. Int. J. Math. Arch. 2011, 2, 1495–1501. [Google Scholar]
  12. Mishra, S.; Raju, L.K.; Misra, U.K.; Misra, G. A study of EOQ model with power demand of deteriorating items under the influence of inflation. Gen. Math. Notes. 2012, 10, 41–50. [Google Scholar]
  13. Singh, D.P.; Kumar, S. A study of order level inventory system using power demand pattern for deteriorate items. Int. J. Eng. Math. Sci. 2012, 1, 178–184. [Google Scholar]
  14. Mishra, S.S.; Singh, P.K. Partial backlogging EOQ model for queued customers with power demand and quadratic deterioration: Computational approach. Am. J. Oper. Res. 2013, 3, 13–27. [Google Scholar]
  15. Rajeswari, N.; Indrani, K. EOQ policies for linearly time dependent deteriorating items with power demand and partial backlogging. Int. J. Math. Arch. 2015, 6, 122–130. [Google Scholar]
  16. Sicilia, J.; Febles-Acosta, J.; González-De la Rosa, M. Deterministic inventory systems with power demand pattern. Asia Pac. J. Oper. Res. 2012, 29, 1250025. [Google Scholar] [CrossRef]
  17. Sicilia, J.; Febles-Acosta, J.; González-De la Rosa, M. Economic order quantity for a power demand pattern system with deteriorating items. Eur. J. Ind. Eng. 2013, 7, 577–593. [Google Scholar] [CrossRef]
  18. San-José, L.A.; Sicilia, J.; González-De-la-Rosa, M.; Febles-Acosta, J. Optimal inventory policy under power demand pattern and partial backlogging. Appl. Math. Model. 2017, 46, 618–630. [Google Scholar] [CrossRef]
  19. Adaraniwon, A.O.; Omar, M.B. An inventory model for delayed deteriorating items with power demand considering shortages and lost sales. J. Intell. Fuzzy Syst. 2019, 36, 5397–5408. [Google Scholar] [CrossRef]
  20. Adaraniwon, A.O.; Omar, M.B. An inventory model for linearly time-dependent deteriorating rate and time-varying demand with shortages partially backlogged. J. Intell. Fuzzy Syst. 2020, 38, 4545–4557. [Google Scholar]
  21. San-José, L.A.; Sicilia, J.; Abdul-Jalbar, B. Optimal policy for an inventory system with demand dependent on price, time and frequency of advertisement. Comput. Oper. Res. 2021, 128, 105169. [Google Scholar] [CrossRef]
  22. Smith, N.R.; Martínez-Flores, J.L.; Cárdenas-Barrón, L.E. Analysis of the benefits of joint price and order quantity optimisation using a deterministic profit maximisation model. Prod. Plan. Control. 2007, 18, 310–318. [Google Scholar] [CrossRef]
  23. Soni, H.N. Optimal replenishment policies for non-instantaneous deteriorating items with price and stock sensitive demand under permissible delay in payment. Int. J. Prod. Econ. 2013, 146, 259–268. [Google Scholar] [CrossRef]
  24. Wu, J.; Skouri, K.; Teng, J.T.; Ouyang, L.Y. A note on “Optimal replenishment policies for non-instantaneous deteriorating items with price and stock sensitive demand under permissible delay in payment”. Int. J. Prod. Econ. 2014, 155, 324–329. [Google Scholar] [CrossRef]
  25. Avinadav, T.; Herbon, A.; Spiegel, U. Optimal ordering and pricing policy for demand functions that are separable into price and inventory age. Int. J. Prod. Econ. 2014, 155, 406–417. [Google Scholar] [CrossRef]
  26. San-José, L.A.; Sicilia, J.; González-De-la-Rosa, M.; Febles-Acosta, J. Best pricing and optimal policy for an inventory system under time-and-price-dependent demand and backordering. Ann. Oper. Res. 2020, 286, 351–369. [Google Scholar] [CrossRef]
  27. Pando, V.; San-José, L.A.; Sicilia, J.; Alcaide-López-de-Pablo, D. Profitability index maximization in an inventory model with a price- and stock-dependent demand rate in a power-form. Mathematics 2021, 9, 1157. [Google Scholar] [CrossRef]
  28. San-José, L.A.; García-Laguna, J. Optimal policy for an inventory system with backlogging and all-units discounts: Application to the composite lot size model. Eur. J. Oper. Res. 2009, 192, 808–823. [Google Scholar] [CrossRef]
  29. Birbil, Ş.İ.; Bülbül, K.; Frenk, J.B.G.; Mulder, H.M. On EOQ cost models with arbitrary purchase and transportation costs. J. Ind. Manag. Optim. 2015, 11, 1211–1245. [Google Scholar]
  30. Jakšič, M.; Fransoo, J.C. Optimal inventory management with supply backordering. Int. J. Prod. Econ. 2015, 159, 254–264. [Google Scholar] [CrossRef] [Green Version]
  31. Mishra, S.S.; Gupta, S.; Yadav, S.K.; Rawat, S. Optimization of fuzzified Economic Order Quantity model allowing shortage and deterioration with full backlogging. Am. J. Oper. Res. 2015, 5, 103–110. [Google Scholar]
  32. San-José, L.A.; Sicilia, J.; González-De-la-Rosa, M.; Febles-Acosta, J. Analysis of an inventory system with discrete scheduling period, time-dependent demand and backlogged shortages. Comput. Oper. Res. 2019, 109, 200–208. [Google Scholar] [CrossRef]
  33. Axsäter, S. Inventory Control; Springer: New York, NY, USA, 2000. [Google Scholar]
  34. Kunreuther, H.; Richard, J.F. Optimal pricing and inventory decisions for non-seasonal items. Econometrica 1971, 39, 173–175. [Google Scholar] [CrossRef]
  35. Kabirian, A. The economic production and pricing model with lot-size-dependent production cost. J. Glob. Optim. 2012, 54, 1–15. [Google Scholar] [CrossRef]
Figure 1. Demand functions D ( t , p ) when n > 1 .
Figure 1. Demand functions D ( t , p ) when n > 1 .
Mathematics 09 01848 g001
Figure 2. Demand functions D ( t , p ) when n = 1 .
Figure 2. Demand functions D ( t , p ) when n = 1 .
Mathematics 09 01848 g002
Figure 3. Demand functions D ( t , p ) when n < 1 .
Figure 3. Demand functions D ( t , p ) when n < 1 .
Mathematics 09 01848 g003
Figure 4. Functions f ( p ) and B ( p ) for Example 1.
Figure 4. Functions f ( p ) and B ( p ) for Example 1.
Mathematics 09 01848 g004
Figure 5. Functions f ( p ) and B ( p ) for Example 3.
Figure 5. Functions f ( p ) and B ( p ) for Example 3.
Mathematics 09 01848 g005
Figure 6. Functions f ( p ) and B ( p ) for Example 4.
Figure 6. Functions f ( p ) and B ( p ) for Example 4.
Mathematics 09 01848 g006
Table 1. Notation.
Table 1. Notation.
ϕ Stock-in period (≥0)
σ Stock-out period (≥0)
TLength of inventory cycle, that is, T = ϕ + σ (>0, decision variable)
QLot size or replenishment size (>0)
SMaximum inventory level (≥0, decision variable)
sReorder point (≤0)
cUnit purchasing cost (>0)
pUnit selling price ( p c ,  decision variable)
AThe cost of placing an order (>0)
hThe unit holding cost per time unit (>0)
π The unit backordering cost per time unit (>0)
D ( t , p ) Demand at time t when the unit selling price is p, for 0 < t < T
I ( t , p ) Inventory level at time t when the unit selling price is p, for 0 t < T
nIndex of the power demand pattern (>0)
G ( S , T , p ) Total Profit per unit time
B ( p ) The optimum profit per unit time for a fixed p, that is, B ( p ) =   G ( S * ( p ) , T * ( p ) , p )
Table 2. Sensitivity of the optimal policy ( p * , T * , S * ) and the maximum profit B * to variations of the parameters α , β and γ when n = 0.5 .
Table 2. Sensitivity of the optimal policy ( p * , T * , S * ) and the maximum profit B * to variations of the parameters α , β and γ when n = 0.5 .
γ β α = 960 α = 1280 α = 1600
p * T * S * B * p * T * S * B * p * T * S * B *
0.8 3633.97031.45619196.2078553.4646.48561.22414233.40018,559.559.84181.07770265.11632,748.6
4030.38181.47661193.4937067.4341.34431.23530231.29115,676.453.04741.08485263.36827,956.3
4427.51881.49838190.6825891.7337.24181.24702229.11713,385.247.62581.09231261.56824,141.2
4825.18701.52160187.7724943.4233.89991.25932226.87911,527.443.20941.10008259.72021,041.5
0.9 3623.50021.48305192.6534642.6830.51461.22897232.48310,432.937.75961.07359266.12918,548.4
4021.42611.51393188.7243759.0127.65361.24552229.3938755.3834.09191.08421263.52415,824.0
4419.74991.54726184.6593056.6425.33951.26295226.2277409.8731.12461.09525260.86613,631.0
4818.36921.58335180.4492488.9723.43121.28132222.9846310.8428.67711.10676258.15511,832.2
1.0 3617.84401.54124185.3802477.7822.19281.25233228.1466029.0726.58111.08315263.78211,025.9
4016.52641.58864179.8491919.4520.42301.27641223.8424969.4024.36391.09831260.1409324.21
4415.45301.64129174.0791478.0718.97691.30206219.4324116.8922.55101.11418256.4357945.94
4814.56341.70034168.0331124.6517.77391.32947214.9083419.8421.04141.13081252.6646810.27
1.1 3614.48141.64466173.7221199.8017.36751.29742220.2183427.8520.24141.10705258.0876632.63
4013.59221.72277165.846841.10416.18801.33301214.3372726.3918.78771.12860253.1595503.76
4412.86781.81504157.415563.85515.21791.37185208.2692164.6517.58961.15144248.1374588.56
4812.27131.92721148.253348.75014.40661.41454201.9841708.7316.58501.17573243.0103835.05
1.2 3612.35731.83341155.837432.57214.34711.37315208.0721811.4016.33401.14852248.7673895.96
4011.74731.98802143.718212.32913.52041.42881199.9671340.2815.32351.17984242.1643121.70
4411.27062.20618129.50653.706612.83951.49242191.444969.26514.48641.21383235.3822497.59
4812.13920012.27111.56645182.396674.86213.78181.25100228.3891987.96
Table 3. Sensitivity of the optimal policy ( p * , T * , S * ) and the maximum profit B * to variations of the parameters α , β and γ when n = 1 .
Table 3. Sensitivity of the optimal policy ( p * , T * , S * ) and the maximum profit B * to variations of the parameters α , β and γ when n = 1 .
γ β α = 960 α = 1280 α = 1600
p * T * S * B * p * T * S * B * p * T * S * B *
0.8 3633.95111.51058330.9998578.4546.46951.27008393.67618,589.259.82751.11822447.13932,782.3
4030.36241.53166326.4447092.0741.32801.28161390.13415,705.953.03301.12562444.20027,989.8
4427.49911.55412321.7255916.0137.22541.29372386.48113,414.447.61141.13334441.17524,174.5
4825.16711.57807316.8434967.3433.88331.30643382.72211,556.343.19491.14137438.07021,074.6
0.9 3623.48151.53804325.0894667.2230.49911.27491392.1861.0462537.74601.11386448.88918,582.3
4021.40691.56987318.4983783.0427.63791.29200386.9978784.5934.07821.12483444.51115,857.6
4419.73021.60420311.6833080.1625.32361.31000381.6817438.6831.11081.13625440.04413,664.2
4818.34911.64135304.6282511.9623.41511.32895376.2376339.2428.66321.14813435.49011,865.1
1.0 3617.82491.59769312.9522501.4022.17741.29886384.9536058.1226.56801.12362444.99011,059.5
4016.50661.64643303.6881942.3620.40731.32370377.7294997.9124.35051.13929438.8729357.34
4415.43231.70050294.0321500.2518.96091.35014370.3314144.8422.53741.15567432.6507978.59
4814.54191.76104283.9241146.0617.75751.37839362.7433447.2121.02751.17283426.3186842.45
1.1 3614.46101.70352293.5101221.9417.35191.34516371.7043455.9020.22821.14818435.4726665.50
4013.57041.78345280.356862.24416.17191.38180361.8462753.6918.77421.17041427.1995536.00
4412.84441.87758266.300583.92815.20111.42175351.6802191.1817.57571.19397418.7724620.16
4812.24571.99149251.069367.66614.38921.46560341.1571734.4616.57081.21901410.1703866.00
1.2 3612.33371.89549263.783452.44914.33051.42282351.4151837.9116.32041.19081419.8813927.65
4011.72042.05175243.694230.67713.50291.47992337.8571365.7615.30941.22307408.8093152.54
4411.23842.26931220.33170.268412.82101.54503323.618993.66814.47181.25804397.4432527.57
4812.13920012.25121.62061308.526698.12013.76661.29624385.7312017.06
Table 4. Sensitivity of the optimal policy ( p * , T * , S * ) and the maximum profit B * to variations of the parameters α , β and γ when n = 2 .
Table 4. Sensitivity of the optimal policy ( p * , T * , S * ) and the maximum profit B * to variations of the parameters α , β and γ when n = 2 .
γ β α = 960 α = 1280 α = 1600
p * T * S * B * p * T * S * B * p * T * S * B *
0.8 3633.88251.74515488.8028668.2746.41151.46819581.01018,696.059.77631.29299659.73732,903.6
4030.29301.76906482.1957180.6741.26971.48133575.85615,811.752.98161.30144655.45328,110.4
4427.42871.79451475.3566003.3437.16651.49512570.54313,519.247.55971.31025651.04524,294.2
4825.09571.82161468.2855053.3633.82401.50959565.07811,660.143.14291.31942646.51921,193.5
0.9 3623.41431.77522480.5244755.4930.44351.47302579.10710,568.937.69741.28752662.54218,704.1
4021.33831.81114470.9923869.5427.58161.49245571.5678889.6334.02921.30003656.16515,978.2
4419.66001.84981461.1473164.8225.26641.51288563.8487542.2831.06131.31304649.66213,783.6
4818.27711.89155450.9712594.7323.35711.53438555.9466441.3728.61321.32658643.03211,983.3
1.0 3617.75661.84122463.2982586.4322.12251.49954568.8636162.6326.52071.29817657.10611,180.3
4016.43581.89577449.9662024.9120.35121.52766558.3935100.4724.30261.31599648.2089476.45
4415.35881.95602436.1061580.2218.90351.55754547.6804245.4122.48871.33461639.1648096.03
4814.46512.02312421.6421223.3317.69871.58939536.7063545.7520.97801.35409629.9676958.18
1.1 3614.38831.95765435.7431301.8117.29501.55109549.9563556.8720.18101.32558643.5156783.72
4013.49332.04565416.998938.60416.11411.59230535.7252852.0218.72591.35078631.5125651.99
4412.76182.14820397.092656.55315.14131.63706521.0782286.7817.52631.37742619.2984733.89
4812.15612.27045375.711436.26014.32701.68599505.9541827.2516.52011.40568606.8463977.42
1.2 3612.25032.16454394.094524.45814.27141.63717521.0411933.4816.27201.37324621.1824041.70
4011.62672.32965366.163297.39713.44071.70059501.6111457.7015.25931.40955605.1793263.62
4411.12832.55028334.486130.91612.75511.77238481.2921081.8114.41991.44880588.7842635.60
4810.74042.87924296.27112.144412.18091.85491459.878782.24413.71271.49151571.9272121.96
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

San-José, L.A.; Sicilia, J.; González-de-la-Rosa, M.; Febles-Acosta, J. Optimal Price and Lot Size for an EOQ Model with Full Backordering under Power Price and Time Dependent Demand. Mathematics 2021, 9, 1848. https://doi.org/10.3390/math9161848

AMA Style

San-José LA, Sicilia J, González-de-la-Rosa M, Febles-Acosta J. Optimal Price and Lot Size for an EOQ Model with Full Backordering under Power Price and Time Dependent Demand. Mathematics. 2021; 9(16):1848. https://doi.org/10.3390/math9161848

Chicago/Turabian Style

San-José, Luis A., Joaquín Sicilia, Manuel González-de-la-Rosa, and Jaime Febles-Acosta. 2021. "Optimal Price and Lot Size for an EOQ Model with Full Backordering under Power Price and Time Dependent Demand" Mathematics 9, no. 16: 1848. https://doi.org/10.3390/math9161848

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop