Next Article in Journal
Hamy Mean Operators Based on Complex q-Rung Orthopair Fuzzy Setting and Their Application in Multi-Attribute Decision Making
Previous Article in Journal
The Learning Trajectories of Similarity in Mathematics Curriculum: An Epistemological Analysis of Hong Kong Secondary Mathematics Textbooks in the Past Half Century
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The EOQ Model for Deteriorating Items with a Conditional Trade Credit Linked to Order Quantity in a Supply Chain System

1
College of Business, Chung Yuan Christian University, Chung Li 320314, Taiwan
2
Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 10607, Taiwan
3
Department of Business Administration, Chihlee University of Technology, Banqiao District, New Taipei City 22050, Taiwan
4
Department of Mathematics and Statistics, University of Victoria, Victoria, BC V8W 3R4, Canada
5
Department of Medical Research, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan
6
Department of Mathematics and Informatics, Azerbaijan University, 71 Jeyhun Hajibeyli Street, Baku AZ1007, Azerbaijan
7
Section of Mathematics, International Telematic University Uninettuno, I-00186 Rome, Italy
8
Department of Applied Mathematics, Chung Yuan Christian University, Chung Li 320314, Taiwan
9
Department of Applied Mathematics and Business Administration, Chung Yuan Christian University, Chung Li 320314, Taiwan
*
Author to whom correspondence should be addressed.
Submission received: 30 June 2021 / Revised: 6 September 2021 / Accepted: 14 September 2021 / Published: 18 September 2021
(This article belongs to the Section Probability and Statistics)

Abstract

:
For generality, we observed that some of the optimization methods lack the mathematical rigor and some of them are based on intuitive arguments which result in the solution procedures being questionable from logical viewpoints of a mathematical analysis such as those in the work by Ouyang et al. (2009). They consider an economic order quantity model for deteriorating items with partially permissible delays in payments linked to order quantity. Basically, their inventory models are interesting, however, they ignore explorations of interrelations of functional behaviors (continuity, monotonicity properties, differentiability, et cetera) of the total cost function to locate the optimal solution, so those shortcomings will naturally influence the implementation of their considered inventory model. Consequently, the main purpose of this paper is to provide accurate and reliable mathematical analytic solution procedures for different scenarios that overcome the shortcomings of Ouyang et al.

1. Introduction

Deterioration plays an essential role in many inventory systems and deterioration refers to factors such as product damage, spoilage, dryness and evaporation which decreases the original quality and quantity of the product, so it is important to control and maintain the inventories of deteriorating items. Inventory problems for deteriorating items have been studied extensively by numerous researchers. Research in this area began with the work of Whitin [1], who considered fashion goods deteriorating at the end of their prescribed storage period. An exponentially decaying inventory was first developed by Ghare and Schrader [2]. A considerable amount of work has been conducted on deteriorating inventory systems, the details of which can be found in review articles by Nahmias [3], the perishable inventory theory, Raafat [4], Goyal and Giri [5], Bakker et al. [6], Mahata [7] and Janssen et al. [8].
Due to huge competition among the business enterprises in the local and in the global market, the business enterprises adopt various tolls to sell their products efficiently. The trade credit policy is one of the most effective promotional tools to push a product. In practice, suppliers usually offer some credit periods to retailers to stimulate the demand for items they produce and reduce the selling price of the item indirectly. They do not charge any interest on the outstanding amount if retailers settle their account within the permissible delay period. This brings some economic advantages to retailers because they earn interest from the revenue realized during the stated period. Offing a trade credit to the small and micro-retailers is commonplace and acceptable as these retailers lack the financial means to pay in full upon the receipt of the items. Meanwhile, the supplier prefers to provide better terms of trade credit such as a payment extension date when the retailer orders a large enough quantity. Furthermore, the trade credit plays a major role in the inventory system for both the supplier and the retailer. Haley and Higgins [9] introduce the first model to consider the economic order quantity (EOQ) model under conditions of a permissible delay of payments. Goyal [10] developed an EOQ model for a retailer when the supplier offers a permissible delay in payments, which differs from the viewpoint of Haley and Higgins [9]. In general, Goyal [10] is more popular than Haley and Higgins [9]; thus, Chang et al. [11] adopted the viewpoints of Goyal [10] for their review article on inventory models under trade credit. Stokes [12] indicates that trade credit represents one of the most flexible sources of short-term financing available to firms principally because it arises spontaneously with the firm’s purchases. Khouja and Mehrez [13] were the first to discuss suppliers only offering a permissible delay in payment when the order quantity is larger than a predetermined quantity. Furthermore, Chang et al. [14] established an EOQ model for deteriorating items, in which the supplier provides a permissible delay to the purchaser if the order quantity is greater than or equal to a predetermined quantity. Many related articles can be found, such as those by Liao [15], Chung [16], Chung [17], Chung et al. [18], Chang et al. [19] and Liao et al. [20].
Numerous published papers assume that the supplier offers the retailer a fully permissible delay in payments independent of the order quantity. Huang [21] considers the case of a conditionally permissible delay, assuming that the supplier only offers the retailer a fully permissible delay in payments if they order more than a predetermined quantity. With the novel invention of Ghare and Schrader [2], the researchers developed various models for deteriorating items under trade credit policy in different circumstances such as Yang [22] further adopts the concept of Huang [21], considering inventory models for deteriorating items in a discount cash flow analysis under alternatives to conditionally permissible delays in payments and cash discounts. Ouyang et al. [23] incorporate the concepts of Ghare and Schrader [2], Goyal [10], Khouja and Mehrez [13], and Huang [21] to consider an EOQ model for deteriorating items with partially permissible delay in payments linked to order quantity. Liao et al. [24] explore an EOQ model for non-instantaneous deteriorating items with imperfect quality and trade credit financing. The purpose of their article is to find an optimal ordering policy for minimising the total relevant inventory cost for the retailer. For literature review, other related articles in this field were given in the articles of Taleizadeh et al. [25], Lashgari et al. [26], Taleizadeh [27], Tiwari et al. [28], Chang et al. [29], Li et al. [30] and Tiwari et al. [31].
Essentially, in order to explore the functional behaviors (such as continuity, monotonicity (increasing and decreasing) properties, differentiability, et cetera) of the object functions (that is, the total cost functions), one can and should apply the mathematically accurate and reliable solution procedures. In fact, if the object function (that is, the total cost functions) is convex, it is easier to find the optimal solution by using the convexity property. In this direction, Chung et al. [32] notice shortcomings in the solution procedure in Leung’s proof based on the complete squares method used by Leung [33]. They then correct and improve the investigation by Leung [33], reiterating the well-established fact that mathematical analytical techniques guarantee accuracy as well as dependability in inventory modelling problems. Chung et al. [34] overcome the shortcomings of Chang and Teng [35] and derive all optimal solutions for the annual total relevant cost Z ( T ) ; their paper also presents in detail the mathematically correct methods for deriving Z ( T ) and locating all optimal solutions. Srivastava et al. [36] modify the annual total relevant cost T R C ( T ) in the study of Teng et al. [37] and present the correct derivations of T R C ( T ) . They also expose logical and mathematical problems in Teng et al.’s proof of Theorem 1. Teng et al. [38] discuss two payment methods for the EPQ model; however, Chung et al. [39] find that the total annual profit for the manufacturer under payment method 1 is incorrect and provided the correct solution procedure for the correct total annual profit. Chung et al. [39] also adopt an alternative but much easier to understand method of characterising the total annual profit, and provide the correct solution algorithm for the total annual profit.
Based upon above arguments, we have observed that some of the optimization methods lack the mathematical rigor and some of them are based on intuitive arguments which result in the solution procedures are questionable from logical viewpoints of mathematical analysis such as Ouyang et al. [23]. They ignored explorations of interrelations of functional behaviors of the total cost function to locate the optimal solution, so those shortcomings will naturally influence the implementation of their considered inventory model. For this reason, it is worth mentioning that, by the usage of the mathematical analytic solution procedures, to overcome the shortcomings of Ouyang et al. [23]. Although Ping [40] explores the optimal solutions from the mathematical points to overcome the shortcomings of Ouyang et al. [23], we will present more complete solution procedures for improvement.
As a summary, the present study will show that the total annual cost function is convex by exploring the functional properties of the total annual cost function such as (for example) the continuity, convexity, monotonicity (increasing and decreasing) and differentiability properties.
Ouyang et al. [23] at least have the following shortcomings about the theoretical results and solution procedures.
(1)
Theorem B (Varberg et al. [41], page 164) can be stated as follows:
Theorem B (Second Derivative Test)
Let f and f exist at every point in an open interval (a, b) containing c , and suppose that f ( c ) = 0 .
(i)
If f ( c ) < 0 , then f ( c ) is a local maximum value of f .
(ii)
If f ( c ) > 0 , then f ( c ) is a local maximum value of f .
So, Theorem B(ii) demonstrates that Equations (A4) and (B4) in Ouyang et al. [23] only assure that T 1 and T 3 are local minimum points of both T R C 1 ( T ) and T R C 3 ( T ) , respectively. Many examples (Varberg et al. [41]) show that Theorem B cannot draw a conclusion about maxima or minima without more information in general.
Consequently, although the results of Lemmas 1–8 and Theorems 1–3 in Ouyang et al. [23] are correct, the processes of proofs of them have shortcomings. Equations (A17a–c), (A26a–c), (A33a–c), (A43a–c) and (A53a–c) reveal the correct ways of discussions about the minimum points T 1 , T 2 , T 3 , T 4 and T 5 of T R C i ( T )   ( i = 1 , 2 , 3 , 4 , 5 ) .
(2)
Ouyang et al. [23] do not demonstrate why Equations (43) and (44) hold. Lemma 1(B) in this paper overcomes these shortcomings.
(3)
Equations (36) and (42) in this paper reveal that Equation (25) in Ouyang et al. [23] is wrong. The correct formulation of Δ 6 should be Equation (45) in this paper. Furthermore, Ouyang et al. [23] do not demonstrate why Equations (46) and (47) hold. Lemma 1(A, B, H) in this paper overcome these shortcomings.
(4)
Equations (36) and (52) in this paper reveal that Equation (30) in Ouyang et al. [23] is wrong. The correct formulation of Δ 9 should be equation (53) in this paper. Furthermore, Ouyang et al. [23] do not demonstrate why Equations (56) and (57) hold. However, Lemma 1(A, B) and Equations (53)–(55) imply that Equations (56) and (57) hold.
(5)
Since Equation (30) in Ouyang et al.’s [23] is wrong, it should not be true in general that Ouyang et al. [23] conclude Δ 9 Δ 7 and Δ 7 Δ 5 . Therefore, it influences the validity of Theorem 3 in Ouyang et al.’s [23]. Theorem 4 in this paper gives the correct results about Case 3.
(6)
Ouyang et al. [23] do not explore the convexity of T R C i ( T ) . However, Theorem 1 in this paper provides the proof of the convexity of T R C i ( T )   ( i = 1 , 2 , 3 , 4 , 5 ) .
(7)
From the discussion about Case 3 in Ouyang et al.’s [23], T R C ( T 0 ) = T R C 4 ( T 0 ) . If T R C 5 ( T 0 ) T R C 4 ( T 0 ) , then T R C ( T 0 ) T R C 5 ( T 0 ) . Therefore, if T R C 5 ( T 0 ) T R C 4 ( T 0 ) , Equation (15) in Ouyang et al.’s [23] is invalid. The correct formulations of T R C ( T ) for Case 3 should be Equation (18a–d) in this paper.

2. Mathematical Formulation

The fallowing notation and assumptions are used in the whole paper.

Assumptions

  • Replenishments are instantaneous.
  • Demand rate, D , is known and constant.
  • Shortages are not allowed.
  • The inventory system involves only one type of inventory.
  • The time horizon is infinite.
  • If Q < W , the partially delayed payment is permitted. Otherwise, the fully delayed payment is permitted. Hence, if Q W , pay c Q after M time periods from the time the order is filled. Otherwise, as the order is filled, the retailer must make a partial payment, ( 1 α ) c D T , to the supplier. Then, the retailer must pay off the remaining balances, α c D T , at the end of the trade credit period. This assumption constitutes the major difference of the proposed model from previous ones.
  • During the time period that the account is not settled, the generated sales revenue is deposited in an interest-bearing account.
  • I k I e .
Indeed, based upon the above detailed notations and assumptions, we present a rather brief description of the model used Ouyang et al. [23].
The inventory level decreases owing to demand as well as deterioration. Thus, the change of inventory level can be represented by the following differential equation:
d I ( t ) d t + θ I ( t ) = D , 0 < t < T ,
with the boundary condition I ( T ) = 0 . The solution of Equation (1) is:
I ( t ) = D θ [ e θ ( T t ) 1 ] , 0 < t < T .
Hence, the order quantity for each cycle is:
Q = I ( 0 ) = D θ ( e θ T 1 ) .
From Equation (3), we can obtain the time interval that W units are depleted to zero due to both demand and deterioration as:
T W = 1 θ ln ( D θ W + 1 ) .
If Q W (i.e., T T W ), then a fully delayed payment is permitted. Otherwise, the partially delayed payment is permitted. Hence, if Q < W (i.e., T < T W ), then the retailer must take a loan (with the interest charged of I k ) to pay the supplier the partial payment of ( 1 α ) c Q when the order is filled at time 0. From the constant sale revenue p D , the retailer will be able to pay off the loan ( 1 α ) c Q at time ( 1 α ) ( c / p ) ( e θ T 1 ) / θ .
Note that (1) if T T W , and the payoff time of the partial payment at ( 1 α ) ( c / p ) ( e θ T 1 ) / θ is shorter or equal to the permissible delay M , then T T 0 1 θ ln ( θ   p M ( 1 α ) c + 1 ) , and vice versa.
Ouyang et al. [23] assume:
T 0 > M .
After that, based on the values of M , T W and T 0 , we had three possible cases: (1) T 0 > M T W , (2) T 0 T W > M and (3) T W T 0 > M .
Case 1. T 0 > M T W
Ouyang et al. [23] reveal that the annual total relevant cost for the retailer in Case 1 can be expressed as:
T R C ( T ) = { (6a) T R C 1 ( T ) i f M T (6b) T R C 2 ( T ) i f T W T M (6c) T R C 3 ( T ) i f 0 < T < T W
where
T R C 1 ( T ) = A T + ( c θ + h ) D θ 2 T ( e θ T θ T 1 ) + c I k D θ 2 T [ e θ ( T M ) _ θ ( T M ) 1 ] p I e D M 2 2 T
T R C 2 ( T ) = A T + ( c θ + h ) D θ 2 T ( e θ T θ T 1 ) p I e D ( M T 2 )
T R C 3 ( T ) = A T + ( c θ + h ) D θ 2 T ( e θ T θ T 1 ) + c I k ( c / p ) ( 1 α ) 2 D 2 θ 2 T ( e θ T 1 ) 2 p I e D 2 T [ T ( 1 α ) ( c / p ) ( e θ T 1 ) / θ ] 2 p I e D ( M T ) T [ T ( 1 α ) ( c / p ) ( e θ T 1 ) / θ ]
Equations (7)–(9) show:
T R C 1 ( M ) = T R C 2 ( M ) ,
and
T R C 3 ( T ) T R C 2 ( T ) = c D ( I k I e ) ( c p ) ( 1 α ) 2 2 θ 2 T ( e θ T 1 ) 2 + p I e D ( 1 α ) ( c p ) ( e θ T 1 ) θ + p I e D ( M T ) ( 1 α ) c p θ T ( e θ T 1 ) > 0 i f 0 < T M .
Therefore,
T R C 3 ( T W ) > T R C 2 ( T W ) .
Therefore, T R C ( T ) is continuous except at T = T W .
Case 2. T 0 T W > M
Similar to the approach used in Case 1, the annual total relevant cost for the retailer in this case can be expressed as:
T R C ( T ) = { (13a) T R C 1 ( T ) i f T W T , (13b) T R C 4 ( T ) i f M T < T W , (13c) T R C 3 ( T ) i f T M .
where
T R C 4 ( T ) = A T + ( c θ + h ) D θ 2 T ( e θ T θ T 1 ) + c I k ( c / p ) ( 1 α ) 2 D 2 θ 2 T ( e θ T 1 ) 2 + c I k D θ 2 T [ e θ ( T M ) θ ( T M ) 1 ] p I e D 2 T [ M ( 1 α ) ( c / p ) ( e θ T 1 ) / θ ] 2
Equations (7) and (14) show:
T R C 4 ( T ) T R C 1 ( T ) = ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 T ( e θ T 1 ) 2 + I e D c M ( 1 α ) θ T ( e θ T 1 ) > 0 i f T > 0 ,
and
T R C 4 ( M ) = T R C 3 ( M ) .
Therefore,
T R C 4 ( T W ) > T R C 1 ( T W ) .
Therefore, T R C ( T ) is continuous except at T = T W .
Case 3. T W T 0 > M
Similar to the approach in Case 1, the annual total relevant cost for the retailer in Case 3 is:
T R C ( T ) = { (18a) T R C 1 ( T ) i f T W < T , (18b) T R C 5 ( T ) i f T 0 < T T W , (18c) T R C 4 ( T ) i f M T T 0 , (18d) T R C 3 ( T ) i f T M .
where
T R C 5 ( T ) = A T + ( c θ + h ) D θ 2 T ( e θ T θ T 1 ) + c I k ( c / p ) ( 1 2 α + 2 α 2 ) D 2 θ 2 T ( e θ T 1 ) 2 + c I k α D ( e θ T 1 ) θ T [ ( 1 α ) ( c / p ) ( e θ T 1 ) / θ M ] .
Since T R C 3 ( M ) = T R C 4 ( M ) , T R C 4 ( T 0 ) T R C 5 ( T 0 ) and T R C 5 ( T W ) T R C 1 ( T W ) , T R C ( T ) is continuous except at T = T 0 and T W .

3. The Functional Behaviors of T R C i ( T ) ( i = 1 ~ 5 )

Lemma 1.
(A) 
θ T e θ T e θ T + 1 is increasing on T > 0 .
(B) 
θ T e θ T e θ T + 1 > 0 if T > 0 .
(C) 
θ 2 T 2 e θ T 2 θ T e θ T + 2 e θ T 2 is increasing on T > 0 .
(D) 
θ 2 T 2 e θ T 2 θ T e θ T + 2 e θ T 2 > 0 if T > 0 .
(E) 
4 θ 2 T 2 e 2 θ T 2 θ 2 T 2 e θ T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) is increasing on T > 0 .
(F) 
4 θ 2 T 2 e 2 θ T 2 θ 2 T 2 e θ T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) > 0 if T > 0 .
(G) 
θ T e θ ( T M ) e θ ( T M ) θ M + 1 is increasing on T > 0 .
(H) 
θ T e θ ( T M ) e θ ( T M ) θ M + 1 > 0 if T > M .
(I) 
θ 2 T 2 e θ ( T M ) 2 θ T e θ ( T M ) + 2 e θ ( T M ) + 2 θ M 2 is increasing on T > 0 .
(J) 
θ 2 T 2 e θ ( T M ) 2 θ T e θ ( T M ) + 2 e θ ( T M ) + 2 θ M 2 > 0 if T > M .
Proof. 
The detailed proof of Lemma 1 has been proved in Appendix A.1.
Case 1: T 0 > M T W
Equations (7)–(9) yield the first-order derivatives of T R C i ( T ) ( i = 1 ~ 5 ) with respect to T as follows:
T R C 1 ( T ) = A T 2 + ( c θ + h ) D ( θ T e θ T θ T + 1 ) θ 2 T 2 + c I k D [ θ T e θ ( T M ) e θ ( T M ) θ M + 1 ] θ 2 T 2 + p I e D M 2 2 T 2 ,
T R C 1 ( T ) = 2 A T 3 + D ( c θ + h ) θ 2 T 3 ( θ 2 T 2 e θ T 2 θ T e θ T + 2 e θ T 2 ) + c I k D θ 2 T 3 ( θ 2 T 2 e θ ( T M ) 2 θ T e θ ( T M ) + 2 e θ ( T M ) + 2 θ M 2 ) p I e D M 2 T 3 ,
T R C 2 ( T ) = A T 2 + D ( c θ + h ) ( θ T e θ T e θ T + 1 ) θ 2 T 2 + p I e D 2 ,
T R C 2 ( T ) = 2 A T 3 + D ( c θ + h ) θ 2 T 3 ( θ 2 T 2 e θ T 2 θ T e θ T + 2 e θ T 2 ) > 0 ,
T R C 3 ( T ) = A T 2 + [ D ( c θ + h ) + θ I e D c ( 1 α ) M ] θ 2 T 2 ( θ T e θ T e θ T + 1 ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) + p I e D 2 ,
T R C 3 ( T ) = 2 A T 3 + [ D ( c θ + h ) + θ I e D c ( 1 α ) M θ 2 T 3 ] ( θ 2 T 2 e θ T 2 θ T e θ T + 2 e θ T 2 ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D [ 4 θ 2 T 2 e 2 θ T 2 θ 2 T 2 e θ T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) ] 2 θ 2 T 3 > 0 ,
Lemma 1(B) and Equations (20), (22) and (24) imply:
T R C 1 ( M ) = T R C 2 ( M ) = Δ 1 M 2 ,
T R C 3 ( T ) > T R C 2 ( T ) > 0   if   T > 0 ,
and
T R C 3 ( T W ) > T R C 2 ( T W ) ,
where
T R C 2 ( T W ) = Δ 2 T W 2 ,
T R C 3 ( T W ) = Δ 3 T W 2 ,
Δ 1 = A + ( c θ + h ) D θ 2 ( θ M e θ M e θ M + 1 ) + p I e D M 2 2 ,
Δ 2 = A + ( c θ + h ) D θ 2 ( θ T W e θ T W e θ T W + 1 ) + p I e D T W 2 2 ,
and
Δ 3 = A + [ D ( c θ + h ) + θ I e D c ( 1 α ) M ] θ 2 ( θ T W e θ T W e θ T W + 1 ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 ( e θ T W 1 ) ( 2 θ T W e θ T W e θ T W + 1 ) + p I e D T W 2 2 ,
Since M T W , Lemma1(A,B) implies:
Δ 1 Δ 2
and
Δ 3 > Δ 2
Let T i denote the minimum point of T R C i ( T ) for all i = 1 , 2 , 3 , 4 , 5 . Then, we had the following results.
Lemma 2.
 
(A) 
 
(i) 
If Δ 1 > 0 , then T R C 1 ( T ) is increasing on [ M , ) .
(ii) 
If Δ 1 0 , then T 1 [ M , ) . We also have that T R C 1 ( T ) is decreasing on ( 0 , T 1 ] and increasing on [ T 1 , ) .
(B) 
 
(i) 
If Δ 2 > 0 , then T R C 2 ( T ) is increasing on [ T W , ) .
(ii) 
If Δ 2 0 < Δ 1 , then T 2 [ T W , M ) . We also have that T R C 2 ( T ) is decreasing on [ T W , T 2 ] and increasing on [ T 2 , M ] .
(iii) 
If Δ 1 0 , then T R C 2 ( T ) is decreasing on [ T W , M ) .
(C) 
 
(i) 
If Δ 3 > 0 , then T 3 ( 0 , T W ) . We also have that T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , T W ) .
(ii) 
If Δ 3 0 , then T R C 3 ( T ) is decreasing on ( 0 , T W ) .
Proof. 
The detailed proof of Lemma 2 has been proved in Appendix A.2.
Case 2: T 0 T W > M
Equation (14) yields:
T R C 4 ( T ) = A T 2 + [ D ( c θ + h ) + θ I e D c ( 1 α ) M ] θ 2 T 2 ( θ T e θ T e θ T + 1 ) + c I k D θ 2 T 2 [ θ T e θ ( T M ) e θ ( T M ) θ M + 1 ] + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) + p I e D M 2 2 T 2 .
and
T R C 4 ( T ) = 2 A T 3 + [ D ( c θ + h ) + θ I e D c ( 1 α ) M ] θ 2 T 3 ( θ 2 T 2 e θ T 2 θ T e θ T + 2 e θ T 2 ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D [ 4 θ 2 T 2 e 2 θ T 2 θ 2 T 2 e θ T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) ] 2 θ 2 T 3 + c I k D θ 2 T 3 [ θ 2 T 2 e θ ( T M ) 2 θ T e θ ( T M ) + 2 e θ ( T M ) + 2 θ M 2 ] p I e D M 2 T 3
Equations (20), (24), (36) and Lemma 1(A) imply:
T R C 4 ( M ) = T R C 3 ( M ) = Δ 5 M 2 ,
and
T R C 4 ( T ) > T R C 1 ( T )   if   T > 0
Of course,
T R C 4 ( T W ) > T R C 1 ( T W ) ,
where
T R C 1 ( T W ) = Δ 4 T W 2 ,
T R C 4 ( T W ) = Δ 6 T W 2 ,
Δ 5 = D ( c θ + h ) θ 2 ( θ M e θ M e θ M + 1 ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 ( e θ M 1 ) ( 2 θ M e θ M e θ M + 1 ) + p I e D M 2 2 + I e D ( 1 α ) c M θ ( θ M e θ M e θ M + 1 ) A ,
Δ 4 = [ D ( c θ + h ) ] θ 2 ( θ T W e θ T W e θ T W + 1 ) + c I k D θ 2 ( θ T W e θ ( T W M ) e θ ( T W M ) θ M + 1 ) + p I e D M 2 2 A
and
Δ 6 = D ( c θ + h ) θ 2 ( θ T W e θ T W e θ T W + 1 ) + c I k D θ 2 [ θ T W e θ ( T W M ) e θ ( T W M ) θ M + 1 ] + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 ( e θ T W 1 ) ( 2 θ T W e θ T W e θ T W + 1 ) + p I e D M 2 2 + I e D ( 1 α ) c M θ ( θ T W e θ T W e θ T W + 1 ) A .
Since T W > M , Equations (41)–(45) and Lemma 1(A,B,H) imply:
Δ 6 > Δ 4 ,
and
Δ 6 > Δ 5 .
Lemma 3.
(A) 
 
(i) 
If Δ 4 > 0 , then T R C 1 ( T ) is increasing on [ T W , ) .
(ii) 
If Δ 4 0 , then T 1 [ T W , ) . We also have that T R C 1 ( T ) is decreasing on [ T W , T 1 ] and increasing on [ T 1 , ) .
(B) 
 
(i) 
If Δ 6 0 , then T R C 4 ( T ) is decreasing on [ M , T W ) .
(ii) 
If Δ 5 0 < Δ 6 , then T 4 [ M , T W ) . We also have that T R C 4 ( T ) is decreasing on [ M , T 4 ] and increasing on [ T 4 , T W ) .
(ii) 
If Δ 5 > 0 , then T R C 4 ( T ) is increasing on [ M , ) .
(C) 
 
(i) 
If Δ 5 > 0 , then T 3 ( 0 , M ) . We also have that T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , M ] .
(ii) 
If Δ 5 0 , then T R C 3 ( T ) is decreasing on ( 0 , M ] .
Proof. 
The detailed proof of Lemma 3 has been proved in Appendix A.3.
Case 3. T W > T 0 > M
Equation (19) yields:
T R C 5 ( T ) = A T 2 + [ D c θ ( 1 I k α M ) + D h ] θ 2 T 2 ( θ T e θ T e θ T + 1 ) + c 2 p I k D 2 θ 2 T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) ,
and
T R C 5 ( T ) = 2 A T 3 + [ D c θ ( 1 I k α M ) + D h ] θ 2 T 3 ( θ 2 T 2 e θ T 2 θ T e θ T + 2 e θ T 2 ) + ( c 2 p ) I k D 2 θ 2 T 3 [ 4 θ 2 T 2 e 2 θ T 2 θ 2 T 2 e θ T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) ] > 0 .
Equations (36) and (48) show:
T R C 5 ( T W ) = Δ 8 T W 2 ,
T R C 5 ( T 0 ) = Δ 7 T W 2
T R C 4 ( T 0 ) = Δ 9 T W 2
where
Δ 8 = [ D c θ ( 1 I k α M ) + D h ] θ 2 ( θ T W e θ T W e θ T W + 1 ) + ( c 2 p ) I k D 2 θ 2 ( e θ T W 1 ) ( 2 θ T W e θ T W e θ T W + 1 ) A
Δ 7 = [ D c θ ( 1 I k α M ) + D h ] θ 2 ( θ T 0 e θ T 0 e θ T 0 + 1 ) + ( c 2 p ) I k D 2 θ 2 ( e θ T 0 1 ) ( 2 θ T 0 e θ T 0 e θ T 0 + 1 ) A
and
Δ 9 = [ D ( c θ + h ) + θ I e D c ( 1 α ) M ] θ 2 ( θ T 0 e θ T 0 e θ T 0 + 1 ) + c I k D θ 2 [ θ T 0 e θ ( T 0 M ) e θ ( T 0 M ) θ M + 1 ] + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 ( e θ T 0 1 ) ( 2 θ T 0 e θ T 0 e θ T 0 + 1 ) + p I e D M 2 2 A
Since T W > T 0 > M , Equations (38), (A40), (53)–(55) and Lemma 1(A,B) reveal that:
Δ 8 > Δ 7 ,
and
Δ 9 > Δ 5 .
Lemma 4.
(A) 
 
(i) 
If  Δ 4 > 0 , then T R C 1 ( T ) is increasing on [ T W , ) .
(ii) 
If Δ 4 0 , then T 1 [ T W , ) . We also have that T R C 1 ( T ) is decreasing on [ T W , T 1 ] and increasing on [ T 1 , ) .
(B) 
 
(i) 
If Δ 7 0 , then T R C 5 ( T ) is increasing on ( T 0 , ) .
(ii) 
If Δ 7 < 0 < Δ 8 , then T 5 [ T 0 , T W ) . We also have that T R C 5 ( T ) is decreasing on ( T 0 , T 5 ] and increasing on [ T 5 , T W ) .
(iii) 
If Δ 8 0 , then T R C 5 ( T ) is decreasing on [ T 0 , T W ) .
(C) 
 
(i) 
If Δ 5 > 0 , then T R C 4 ( T ) is increasing on [ M , ) .
(ii) 
If Δ 5 0 < Δ 9 , then T 4 [ M , T 0 ) . We also have that T R C 4 ( T ) is decreasing on [ M , T 4 ] and increasing on [ T 4 , T 0 ] .
(iii) 
If Δ 9 0 , then T R C 4 ( T ) is decreasing on [ M , T 0 ] .
(D) 
 
(i) 
If Δ 5 > 0 , then T 3 ( 0 , M ) . We also have that T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , M ] .
(ii) 
If Δ 5 0 , then T R C 3 ( T ) is decreasing on ( 0 , M ] .
Proof. 
The detailed proof of Lemma 4 has been proved in Appendix A.4.
Theorem 1.
(A) 
If 2 A p I e D M 2 0 , then T R C 1 ( T ) is convex on T M .
(B) 
T R C 2 ( T ) is convex on T > 0 .
(C) 
T R C 3 ( T ) is convex on T > 0 .
(D) 
If 2 A p I e D M 2 0 , then T R C 4 ( T ) is convex on T M .
(E) 
T R C 5 ( T ) is convex on T > 0 .
Proof. 
(A)
Equation (21) and Lemma 1(D,J) imply that (A) holds.
(B)
Equation (23) and Lemma 1(D) imply that (B) holds.
(C)
Equation (25) and Lemma 1(D,F) imply that (C) holds.
(D)
Equation (37) and Lemma 1(D,F,J) imply that (D) holds.
(E)
Equation (49) and Lemma 1(D,F) imply that (E) holds.
Incorporating (A)–(E), we completed the proof of Theorem 1. □

4. Theorems for the Optimal Replenishment Cycle Time T * of T R C ( T )

Theorem 2.
For T 0 > M T W , the optimal replenishment cycle time T * that minimizes T R C ( T ) is given as follows:
(A) 
If Δ 1 0 and Δ 3 0 , then T R C ( T * ) = T R C 1 ( T 1 ) and T * = T 1 .
(B) 
If Δ 1 0 and Δ 3 > 0 , then T R C ( T * ) = m i n { T R C 1 ( T 1 ) , T R C 3 ( T 3 ) } and T * = T 1 or T 3 associated with the least cost.
(C) 
If Δ 1 > 0 , Δ 2 0 and Δ 3 > 0 , then T R C ( T * ) = T R C 2 ( T 2 ) and T * = T 2 .
(D) 
If Δ 2 > 0 , then T R C ( T * ) = m i n { T R C 2 ( T W ) , T R C 3 ( T 3 ) } and T * = T W or T 3 associated with the least cost.
(E) 
If Δ 1 > 0 and Δ 3 0 , then T R C ( T * ) = T R C 2 ( T 2 ) and T * = T 2 .
Proof. 
The detailed proof of Theorem 2 has been proved in Appendix A.5.
Actually, based upon the above detailed arguments, we have the following remark:
Remark 1.
If Δ 1 > 0 , Δ 2 0 and Δ 3 > 0 , then Ouyang et al. [23] imply T * = T 2 or T 3 . However, Theorem 2(C) in this paper concludes T * = T 2 . So, Theorem 2(C) in this paper simplifies the corresponding result of Theorem 1 in Ouyang et al. [23].
Theorem 3.
For T 0 T W > M , the optimal replenishment cycle time T * that minimizes T R C ( T ) is given as follows:
(A) 
If Δ 6 0 , then T R C ( T * ) = T R C 1 ( T 1 ) and T * = T 1 .
(B) 
If Δ 4 0 , Δ 5 0 and Δ 6 > 0 , then T R C ( T * ) = T R C 1 ( T 1 ) and T * = T 1 .
(C) 
If Δ 4 0 and Δ 5 > 0 , then T R C ( T * ) = m i n { T R C 1 ( T 1 ) , T R C 3 ( T 3 ) } and T * = T 1 or T 3 .
(D) 
If Δ 4 > 0 and Δ 5 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T W ) } and T * = T 4 or T W associated with the least cost.
(E) 
If Δ 4 > 0 and Δ 5 > 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } and T * = T 3 or T W associated with the least cost.
Proof. 
The proof of Theorem 3 is similar to the proof of Theorem 2. □
Likewise, based upon the above theorem, we had the following remarks:
Consider the following two conditions:
(C1)
Δ 6 0 ;
(C2)
Δ 4 0 , Δ 5 0 and Δ 6 > 0 .
Remark 2.
About (C1): If (C1) holds, then Ouyang et al. [23]imply  T * = T 1  or  M . However, Theorem 3(A) in this paper concludes  T * = T 1 .
Remark 3.
About (C2): If (C2) holds, then Ouyang et al. [23] imply  T * = T 1  or  T 4 . However, Theorem 3(B) in this paper concludes  T * = T 1 .
Combining the above arguments, we reveal that Theorem 3(A,B) in this paper simplify the corresponding results of Theorem 2 in Ouyang et al. [23], this conclusion is the same as Ping [40].
Next, let:
G 1 = T R C 5 ( T 0 ) T R C 4 ( T 0 ) ,   and
H 1 = T R C 1 ( T W ) T R C 5 ( T W ) .
Then, there are four situations to occur.
(S1) G 1 > 0 and H 1 > 0 if, and only if:
T R C 5 ( T 0 ) > T R C 4 ( T 0 ) ,   and
T R C 1 ( T W ) > T R C 5 ( T W ) .
(S2) G 1 > 0 and H 1 0 if, and only if:
T R C 5 ( T 0 ) > T R C 4 ( T 0 ) ,   and T R C 1 ( T W ) T R C 5 ( T W )
(S3) G 1 0 and H 1 > 0 if, and only if:
T R C 5 ( T 0 ) T R C 4 ( T 0 ) ,   and T R C 1 ( T W ) > T R C 5 ( T W ) .
(S4) G 1 0 and H 1 0 if, and only if:
T R C 5 ( T 0 ) T R C 4 ( T 0 ) ,   and   T R C 1 ( T W ) > T R C 5 ( T W ) .
Theorem 4.
For T W > T 0 > M , the optimal replenishment cycle time T * that minimizes T R C ( T ) is given as follows:
(A) 
Suppose Δ 4 > 0 , Δ 5 > 0 and Δ 7 0 . Hence,
(a1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = T R C 3 ( T 3 ) .
(a2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } .
(a3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T 0 ) T R C 3 ( T 3 ) , then T R C ( T * ) = T R C 3 ( T 3 ) .
(ii) 
if T R C 5 ( T 0 ) < T R C 3 ( T 3 ) , then T * does not exist.
(a4) 
if G 1 0 and H 1 0 , hence, (i)(ii)(iii)
(i) 
if T R C 5 ( T 0 ) m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } .
(ii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } .
(iii) 
if T R C 5 ( T 0 ) < T R C 4 ( T 0 ) and T R C 5 ( T 0 ) m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } .
(B) 
Suppose Δ 4 > 0 , Δ 5 > 0 and Δ 7 < 0 < Δ 8 . Hence,
(b1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 5 ( T 5 ) } .
(b2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 5 ( T 5 ) , T R C 1 ( T W ) } .
(b3) 
if G 1 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 5 ( T 5 ) } .
(b4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 5 ( T 5 ) , T R C 1 ( T W ) } .
(C) 
Suppose Δ 4 > 0 , Δ 5 > 0 and Δ 8 0 . Hence,
(c1) 
if G 1 > 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T W ) T R C 3 ( T 3 ) , then T R C ( T * ) > T R C 3 ( T 3 ) .
(ii) 
if T R C 5 ( T W ) < T R C 3 ( T 3 ) , then T * does not exist.
(c2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } .
(c3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T W ) T R C 3 ( T 3 ) , then T R C ( T * ) = T R C 3 ( T 3 ) .
(ii) 
if T R C 5 ( T W ) < T R C 3 ( T 3 ) , then T * does not exist.
(c4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T W ) } .
(D) 
Suppose Δ 4 > 0 , Δ 5 0 , Δ 7 0 and Δ 9 > 0 . Hence,
(d1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = T R C 4 ( T 4 ) .
(d2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T W ) } .
(d3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T 0 ) T R C 4 ( T 4 ) , then T R C ( T * ) = T R C 4 ( T 4 ) .
(ii) 
if T R C 5 ( T 0 ) < T R C 3 ( T 3 ) , then T * does not exist.
(iii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = T R C 4 ( T 4 ) .
(d4) 
if G 1 0 and H 1 0 , hence,
(i) 
if T R C 5 ( T 0 ) m i n { T R C 4 ( T 4 ) , T R C 1 ( T W ) } , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T W ) } .
(ii) 
if T R C 5 ( T 0 ) < m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(iii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T W ) } .
(E) 
Suppose Δ 4 > 0 , Δ 5 0 , Δ 7 < 0 < Δ 8 and Δ 9 > 0 . Hence,
(e1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 5 ( T 5 ) } .
(e2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 5 ( T 5 ) , T R C 1 ( T W ) } .
(e3) 
if G 1 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 5 ( T 5 ) } .
(e4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 5 ( T 5 ) , T R C 1 ( T W ) } .
(F) 
Suppose Δ 4 > 0 , Δ 5 0 , Δ 8 0 and Δ 9 > 0 . Hence,
(f1) 
if G 1 > 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T W ) T R C 4 ( T 4 ) , then T R C ( T * ) = T R C 4 ( T 4 ) .
(ii) 
if T R C 5 ( T W ) < T R C 4 ( T 4 ) , then T * does not exist.
(f2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T W ) } .
(f3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T W ) T R C 4 ( T 4 ) , then T R C ( T * ) = T R C 4 ( T 4 ) .
(ii) 
if T R C 5 ( T W ) < T R C 4 ( T 4 ) , then T * does not exist.
(f4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T W ) } .
(G) 
Suppose Δ 4 > 0 , Δ 5 0 , Δ 7 0 and Δ 9 0 . Hence,
(g1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = T R C 4 ( T 0 ) .
(g2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 1 ( T W ) } .
(g3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T 0 ) < T R C 4 ( T 0 ) , then T * does not exist.
(ii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = T R C 4 ( T 0 ) .
(g4) 
if G 1 0 and H 1 0 , hence,
(i) 
if T R C 5 ( T 0 ) T R C 1 ( T W ) , then T R C ( T * ) = T R C 1 ( T W ) .
(ii) 
if T R C 5 ( T 0 ) < T R C 4 ( T 0 ) and T R C 5 ( T 0 ) < T R C 1 ( T W ) , then T * does not exist.
(H) 
Suppose Δ 4 > 0 , Δ 5 0 , Δ 7 < 0 < Δ 8 and Δ 9 0 . Hence,
(h1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 5 ( T 5 ) }
(h2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 5 ( T 5 ) , T R C 1 ( T W ) } .
(h3) 
if G 1 0 and H 1 > 0 , then T R C ( T * ) = T R C 5 ( T 5 ) .
(h4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 5 ( T 5 ) , T R C 1 ( T W ) } .
(I) 
Suppose Δ 4 0 , Δ 5 0 , Δ 8 0 and Δ 9 0 . Hence,
(i1) 
if G 1 > 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T W ) T R C 4 ( T 0 ) , then T R C ( T * ) = T R C 4 ( T 0 ) .
(ii) 
if T R C 5 ( T W ) < T R C 4 ( T 0 ) , then T * does not exist.
(i2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 1 ( T W ) } .
(i3) 
if G 1 0 and H 1 > 0 , then T * does not exist.
(i4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = T R C 1 ( T W ) .
(J) 
Suppose Δ 4 > 0 , Δ 5 > 0 and Δ 7 0 . Hence,
(j1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(j2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(j3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T 0 ) m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(ii) 
if T R C 5 ( T 0 ) < m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(iii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(j4) 
if G 1 0 and H 1 0 , hence,
(i) 
if T R C 5 ( T 0 ) m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(ii) 
if T R C 5 ( T 0 ) < T R C 4 ( T 0 ) and T R C 5 ( T 0 ) < m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(iii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(K) 
Suppose Δ 4 0 , Δ 5 > 0 and Δ 7 < 0 < Δ 8 . Hence,
(k1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 1 ( T 1 ) , T R C 3 ( T 3 ) , T R C 5 ( T 5 ) } .
(k2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 1 ( T 1 ) , T R C 3 ( T 3 ) , T R C 5 ( T 5 ) } .
(k3) 
if G 1 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 1 ( T 1 ) , T R C 3 ( T 3 ) , T R C 5 ( T 5 ) } .
(k4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 1 ( T 1 ) , T R C 3 ( T 3 ) , T R C 5 ( T 5 ) } .
(L) 
Suppose Δ 4 0 , Δ 5 > 0 and Δ 8 0 . Hence,
(l1) 
if G 1 > 0 and H 1 > 0 , hence,
(i) 
if  T R C 5 ( T W ) m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(ii) 
if  T R C 5 ( T W ) < m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(l2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(l3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if  T R C 5 ( T W ) m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(ii) 
if T R C 5 ( T W ) < m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(l4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 3 ( T 3 ) , T R C 1 ( T 1 ) } .
(M) 
Suppose Δ 4 0 , Δ 5 0 , Δ 7 0 and Δ 9 > 0 . Hence,
(m1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } .
(m2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } .
(m3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T 0 ) m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } .
(ii) 
if T R C 5 ( T 0 ) < T R C 4 ( T 0 ) and T R C 5 ( T 0 ) < m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(iii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } .
(m4) 
if G 1 0 and H 1 0 , hence,
(i) 
if T R C 5 ( T 0 ) m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } .
(ii) 
if T R C 5 ( T 0 ) < T R C 4 ( T 0 ) and T R C 5 ( T 0 ) < m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(iii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } .
(N) 
Suppose Δ 4 0 , Δ 5 0 , Δ 7 < 0 < Δ 8 and Δ 9 > 0 . Hence,
(n1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 5 ( T 5 ) , T R C 1 ( T 1 ) } .
(n2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 5 ( T 5 ) , T R C 1 ( T 1 ) } .
(n3) 
if G 1 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 5 ( T 5 ) , T R C 1 ( T 1 ) }   .
(n4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 5 ( T 5 ) , T R C 1 ( T 1 ) } .
(O) 
Suppose Δ 4 0 , Δ 5 0 , Δ 8 0 and Δ 9 > 0 . Hence,
(o1) 
if G 1 > 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T W ) m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) }
(ii) 
if T R C 5 ( T W ) < m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(o2) 
if G 1 > 0 and H 1 0 , then T R C 5 ( T W ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } .
(o3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T W ) m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) }
(ii) 
if T R C 5 ( T W ) < m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(o4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 4 ) , T R C 1 ( T 1 ) } .
(P) 
Suppose Δ 4 0 , Δ 5 0 , Δ 7 0 and Δ 9 0 . Hence,
(p1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 1 ( T 1 ) } .
(p2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 1 ( T 1 ) } .
(p3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T 0 ) T R C 1 ( T 1 ) , then T R C ( T * ) = T R C 1 ( T 1 ) .
(ii) 
if T R C 5 ( T 0 ) < T R C 4 ( T 0 ) and T R C 5 ( T 0 ) < T R C 1 ( T 1 ) , then T * does not exist.
(iii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 1 ( T 1 ) } .
(p4) 
if G 1 0 and H 1 0 , hence,
(i) 
if T R C 5 ( T 0 ) T R C 1 ( T 1 ) , then T R C ( T * ) = T R C 1 ( T 1 ) .
(ii) 
if T R C 5 ( T 0 ) < T R C 4 ( T 0 ) and T R C 5 ( T 0 ) < T R C 1 ( T 1 ) , then T * does not exist.
(iii) 
if T R C 5 ( T 0 ) = T R C 4 ( T 0 ) , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 1 ( T 1 ) } .
(Q) 
Suppose Δ 4 0 , Δ 5 0 , Δ 7 < 0 < Δ 8 and Δ 9 0 . Hence,
(q1) 
if G 1 > 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 5 ( T 5 ) , T R C 1 ( T 1 ) } .
(q2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 5 ( T 5 ) , T R C 1 ( T 1 ) } .
(q3) 
if G 1 0 and H 1 > 0 , then T R C ( T * ) = m i n { T R C 5 ( T 5 ) , T R C 1 ( T 1 ) } .
(q4) 
if G 1 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 5 ( T 5 ) , T R C 1 ( T 1 ) } .
(R) 
Suppose Δ 4 0 , Δ 5 0 , Δ 8 0 and Δ 9 0 . Hence,
(r1) 
if G 1 > 0 and H 1 > 0 , hence,
(i) 
if  T R C 5 ( T W ) m i n { T R C 4 ( T 0 ) , T R C 1 ( T 1 ) } , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 1 ( T 1 ) }
(ii) 
if T R C 5 ( T W ) < m i n { T R C 4 ( T 0 ) , T R C 1 ( T 1 ) } , then T * does not exist.
(r2) 
if G 1 > 0 and H 1 0 , then T R C ( T * ) = m i n { T R C 4 ( T 0 ) , T R C 1 ( T 1 ) } .
(r3) 
if G 1 0 and H 1 > 0 , hence,
(i) 
if T R C 5 ( T W ) T R C 1 ( T 1 ) , then T R C ( T * ) = T R C 1 ( T 1 ) .
(ii) 
if T R C 5 ( T W ) < T R C 1 ( T 1 ) , then T * does not exist.
(r4) 
if G 1 0 and H 1 0 , then  T R C ( T * ) = T R C 1 ( T 1 ) .
Proof. 
The detailed proof of Theorem 4 has been proved in Appendix A.6.
To our best knowledge, the object function (that is, the total cost function) of this paper was a piecewise continuous function; therefore, the standard approach is to use calculus to explore functional behaviors (such as continuous, increasing, decreasing, convex, concave, etc.) of that object function and reveal it is increasing or decreasing in its own domain. After that, we discussed the continuity of the objective function specially at its extreme point(s). Consequently, the main purpose of this paper was to provide accurate and reliable mathematical analytic solution procedures for different scenarios that overcome the shortcomings of Ouyang et al.

5. Numerical Examples

Example 1.
Given A = USD11.25/order, D = 1000 units/year, M = 0.12 years, h = USD5/unit/year, I k = USD0.1/USD/year, I e = USD0.07/USD/year, p = USD50/unit, c = USD10/unit, W = 50 units, θ = 0.05 and α = 0.2, we then have T W = 0.049937603, T 0 = 0.736279462, T 0 > M > T W , Δ 1  = 53.708884 > 0, Δ 2  = −38.76674266 < 0 and Δ 3 = 0.035573674 > 0. Following Step 2(3) of the algorithm described in Ouyang et al. [23], we obtained:
T R C ( T * ) = m i n { T R C 2 ( T 2 ) , T R C 3 ( T 3 ) } .
However, if we followed Theorem 2(C) in this paper, we had:
T R C ( T * ) = T R C 2 ( T 2 ) .
Applying the Intermediate Value Theorem (Varberg et al. [41]) to F 2 ( T ) and F 3 ( T ) , we obtained T 2 = 0.0499766, T 3 = 0.049870522 and T R C 2 ( T 2 )  = 30.11469284 < 98.35926525 = T R C 3 ( T 3 ) . Therefore, T * = T 2 . Theorem 2(C) in this paper simplified Step 2(3) of the algorithm described in Ouyang et al. [1].
Example 2.
Given A = USD150/order, D = 1000 units/year, M = 0.12 years, h = USD5/unit/year, I k = USD0.1/USD/year, I e = USD0.07/USD/year, p = USD50/unit, c = USD20/unit, W = 150 units, θ = 0.05 and α = 0.5, we then have T W  = 0.149440296, T 0  = 0.591176044, T 0 > M > T W and Δ 6 = −48.81286509 < 0. Following Step 3(1) of the algorithm described in Ouyang et al. [23], we obtained:
T R C ( T * ) = m i n { T R C 1 ( T 1 ) , T R C 3 ( M ) } .
However, if we followed Theorem 3(A) in this paper, we had:
T R C ( T * ) = T R C 1 ( T 1 ) .
Applying the Intermediate Value Theorem (Varberg et al. [41]) to F 1 ( T ) , we obtained T 1 = 0.18609161 and T R C 1 ( T 1 )  = 1254.146557 < 1488.595181 = T R C 3 ( M ) . Therefore, T * = T 1 . Theorem 3(A) in this paper simplified Step 3(1) of the algorithm described in Ouyang et al. [23].
Example 3.
Given A = USD50/order, D = 1000 units/year, M = 0.12 years, h = USD5/unit/year, I k = USD0.1/USD/year, I e = USD0.07/USD/year, p = USD50/unit, c = USD30/unit, W = 250 units, θ = 0.05 and α = 0.1, we then have T 0 = 0.220996723, T W = 0.2484504, T W > T 0 > M , T R C 4 ( T 0 ) = 1029.265035, T R C 5 ( T 0 ) = 1112.049231, T R C 1 ( T W ) = 1010.464592, T R C 5 ( T W ) = 1197.715922,
G 1 = T R C 5 ( T 0 ) T R C 4 ( T 0 ) = 82.784196 > 0
H 1 = T R C 1 ( T W ) T R C 5 ( T W ) = 187.25133 < 0
Δ 4  = 248.729873, Δ 5 = 25.4570077, Δ 7 = 154.7950047, Δ 8 = 209.1780964 and Δ 9 = 198.1043919. Following Steps 4–2(6) of the algorithm described in Ouyang et al. [23], then:
T R C ( T * ) = m i n { T R C 1 ( T W ) , T R C 3 ( T 3 ) , T R C 5 ( T 0 ) } .
However, Equation (18b) revealed T R C ( T 0 ) T R C 5 ( T 0 ) and T R C ( T 0 ) = T R C 4 ( T 0 ) . Therefore, Equation (70) can be modified as:
T R C ( T * ) = m i n { T R C 1 ( T W ) , T R C 3 ( T 3 ) , T R C 4 ( T 0 ) } .
On the other hand, by Theorem 4(A-a2), we obtained:
T R C ( T * ) = m i n { T R C 1 ( T W ) , T R C 3 ( T 3 ) } .
Applying the Intermediate Value Theorem (Varberg et al.[41]) to F 3 ( T ) , we obtained:
T 3 = 0.097774218 and T R C 3 ( T 3 )  = 829.3667074 < T R C 1 ( T W ) < T R C 4 ( T 0 ) < T R C 5 ( T 0 ) . Therefore, T * = T 3 . Theorem 4(A-a2) in this paper simplified Step 4.2(6) of the algorithm described in Ouyang et al. [23].

6. Conclusions

Ouyang et al. [23] developed two solution approaches to solve the problem. The first approach was to use any standard nonlinear programming software to solve ten subcases described in Ouyang et al. [23]. However, the second approach was to develop algorithms by using the characteristics of Theorems 1–3 in Ouyang et al.’s [23].
(I)
The nonlinear programming software approach: Referring to Equations (6c), (13b) and (18b) in this paper, we found that the valid domains of T R C 3 ( T ) for Case 1, T R C 4 ( T ) for Case 2 and T R C 5 ( T ) for Case 3 should have been ( 0 , T W ) , [ M , T W ) and ( 0 , T W ) , respectively. Therefore, problems S–3 (Case 1), S–5 (Case 2) and S–8 (Case 3) should be modified as follows:
  • S ¯ -3 (Case 1): minimize T R C 3 ( T )
  • subject to 0 < T < T W .
  • S ¯ -5 (Case 2): minimize T R C 4 ( T )
  • subject to M T < T W .
  • S ¯ -8 (Case 3): minimize T R C 5 ( T )
  • subject to T 0 < T < T W .
(A)
About problem S ¯ -3: Lemma 2(C(ii)) implies that if Δ 3 0 , then T R C 3 ( T ) is decreasing on ( T 0 , T W ) . Therefore, T R C 3 ( T ) will have no minimum point on ( 0 , T W ) . Therefore, if Δ 3 0 , then, the minimum point of problem S ¯ -3 does not exist.
(B)
About problem S ¯ -5: Lemma 3(B(i)) implies that if Δ 6 0 , then T R C 4 ( T ) is decreasing on [ M , T W ) . Therefore, T R C 4 ( T ) will have no minimum point on [ M , T W ) . Therefore, if Δ 6 0 , then, the minimum point of problem S ¯ -5 does not exist.
(C)
About problem S ¯ -8: Lemma 4(B(iii)) implies that if Δ 8 0 , then T R C 5 ( T ) is decreasing on ( 0 , T W ) . Therefore, T R C 5 ( T ) will have no minimum point on ( T 0 , T W ) . Therefore, if Δ 8 0 , then, the minimum point of problem S ¯ -8 does not exist.
Incorporating the above arguments, we concluded that the nonlinear programming software approach may not be necessarily valid.
(II)
The algorithm approach:
(A)
About Step 2(3) in Ouyang et al.’s [23]: Following Theorem 2(C) in this paper, Step 2(3) in Ouyang et al.’s [23] can be modified as follows:
  • (3)′ If Δ 1 > 0 , Δ 2 0 and Δ 3 > 0 , then T R C ( T * ) = T R C 2 ( T 2 ) and T * = T 2 . Go to Step 5.
(B)
About Step 3(1) in Ouyang et al.’s [23]: Following Theorem 3(A) in this paper, Step 3(1) in Ouyang et al.’s [23] can be modified as follows:
  • (1)′ If Δ 6 0 , then T R C ( T * ) = T R C 1 ( T 1 ) and T * = T 1 . Go to Step 5.
(C)
About Step 3(2) in Ouyang et al.’s [23]: Following Theorem 3(B) in this paper, Step 3(2) in Ouyang et al.’s [23] can be modified as follows:
  • (2)′ If Δ 4 0 , Δ 5 0 and Δ 6 > 0 , then T R C ( T * ) = T R C 1 ( T 1 ) and T * = T 1 . Go to Step 5.
(D)
About Step 4 in Ouyang et al.’s [1]: Example 3 reveals T R C ( T 0 ) T R C 5 ( T 0 ) and T R C 1 ( T W ) T R C 5 ( T W ) . Equation (18a–d) implies that T R C ( T ) is not continuous at T = T 0 and T W , in general. Furthermore, Ouyang et al. [1] do not demonstrate whether both Δ 9 Δ 7 and Δ 7 Δ 5 hold. Therefore, this paper divided the discussion into four parts:
(1)
If G 1 > 0 and H 1 > 0 ,
(2)
If G 1 > 0 and H 1 0 ,
(3)
If G 1 0 and H 1 > 0 ,
(4)
If G 1 0 and H 1 0 .
In order to obtain the thorough solution procedures to obtain the optimal solution of T R C ( T ) for Case 3, Ouyang et al. [23] ignore the discontinuity of T R C ( T ) for Case 3. It may be such that Theorem 3 in Ouyang et al.’s [23] may not be complete. For T W > T 0 > M , if Δ 4 0 , Δ 5 > 0 , Δ 7 < 0 < Δ 8 and Δ 9 > 0 , then Theorem 4(K) in this paper implies:
T R C ( T * ) = m i n { T R C 1 ( T 1 ) , T R C 3 ( T 3 ) , T R C 5 ( T 5 ) }
However, under this case, Theorem 3 in Ouyang et al.’s [23] cannot provide the optimal solution of T R C ( T ) for Case 3 since Ouyang et al. [23] always treated Δ 7 Δ 5 . Therefore, Step 4 of the algorithm described in Ouyang et al. [23] may not necessarily be valid as well.
In general, facing an optimal problem of an objective function, the standard approach is to use calculus to explore functional behaviors (such as continuous, increasing, decreasing, convex, concave, etc.) of that objective function. Ouyang et al. [23] adopted the first-order necessary condition and the second derivative test (such as equations (A4) and (B4) in Ouyang et al.’s [23] to conclude that T i is the minimum point of T R C i ( T ) ( i = 1 5 ) . However, many examples revealed that Theorem B (Second Derivative Test) (Varberg et al. [41], page 164) cannot draw a conclusion about the maxima or minima without more information in general. Therefore, the processes of proofs of Lemmas 1–8 and Theorems 1–3 in Ouyang et al.’s [23] have shortcomings. Lemmas 2–4 in this paper adopted calculus to explore functional behaviors of T R C i ( T )   ( i = 1 , 2 , 3 , 4 , 5 ) to present the correct proofs for Theorems 2–4 in this paper to overcome shortcomings occurring in Lemmas 1–8 and Theorems 1–3 of Ouyang et al.’s [23]. Incorporating the above arguments, we conclude that this paper improves Ouyang et al.’s [23].

Author Contributions

Conceptualization, K.-J.C., J.-J.L. and S.-D.L.; methodology, K.-J.C., J.-J.L., S.-D.L. and H.M.S.; software, S.-D.L. and S.-F.L.; validation, S.-D.L. and H.M.S.; formal analysis, K.-J.C., J.-J.L., S.-D.L. and H.M.S.; investigation, K.-J.C., J.-J.L. and S.-D.L.; resources, K.-J.C., J.-J.L. and S.-D.L.; data curation, S.-D.L. and S.-F.L.; writing—original draft preparation, K.-J.C., J.-J.L., S.-D.L. and S.-F.L.; writing—review and editing, K.-J.C., J.-J.L., S.-F.L. and H.M.S.; visualization, J.-J.L. and S.-F.L.; supervision, K.-J.C., S.-D.L. and H.M.S.; project administration, K.-J.C., J.-J.L., S.-D.L. and H.M.S.; funding acquisition, not applicable. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Conflicts of Interest

The authors declared that they have no conflict of interest to this work.

Notation

D the annual demand
A the ordering cost per order
W the quantity at which the fully delay payment permitted per order
c the purchasing cost per unit
h the unit holding cost per year excluding interest charge
p the selling price per unit
I e the interest earned per dollar per year
I k the interest charged per dollar in stocks per year
M the period of permissible delay in settling accounts
α the   fraction   of   the   delay   payments   permitted   by   the   supplier   per   order ,   0 α 1 ,   1 I k α M > 0
θ the   deterioration   rate ,   0 θ < 1
T the replenishment cycle time in years
Q the order quantity
T R C ( T ) the   annual   total   relevant   cos t ,   which   is   a   function   of   T
T * the   optimal   replenishment   cycle   time   of   T R C ( T )

Appendix A

Appendix A.1. Proof of Lemma 1

Proof. 
(A) and (B): Let:
f 1 ( T ) = θ T e θ T e θ T + 1
Equation (A1) yields:
f 1 ( T ) = θ 2 e θ T > 0   if   T > 0
Therefore, we have:
(i) 
f 1 ( T ) is increasing on T > 0 .
(ii) 
f 1 ( T ) > f 1 ( 0 ) = 0 if T > 0 .
Both (i) and (ii) conclude that (A) and (B) hold.
(C) and (D): Let:
f 2 ( T ) = θ 2 T 2 e θ T 2 θ T e θ T + 2 e θ T 2
Equation (A2) yields:
f 2 ( T ) = θ 3 T 2 e θ T > 0   if   T > 0
Therefore, we have:
(iii) 
f 2 ( T ) is increasing on T > 0 .
(iv) 
f 2 ( T ) > f 2 ( 0 ) = 0 if T > 0 .
Both (iii) and (iv) conclude that (C) and (D) hold.
(E) and (F): Let:
f 3 ( T ) = 4 θ 2 T 2 e 2 θ T 2 θ 2 T 2 e θ T 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) .
Therefore, we have:
f 3 ( T ) = 2 θ 3 T 2 e θ T ( 4 e θ T 1 ) > 0   if   T > 0 .
Furthermore, Equation (A5) implies:
(v) 
f 3 ( T ) is increasing on T > 0 .
(vi) 
f 3 ( T ) > f 3 ( 0 ) = 0 .
Both (v) and (vi) conclude that (E) and (F) hold.
(G) and (H): Let:
f 4 ( T ) = θ T e θ ( T M ) e θ ( T M ) θ M + 1   if   T > 0
Equation (A6) yields:
f 4 ( T ) = θ 2 T e θ ( T M ) > 0   if   T > 0
Furthermore, Equation (A7) implies:
(vii) 
f 4 ( T ) is increasing on T > 0 .
(viii) 
f 4 ( T ) > f 4 ( M ) = 0 if T > M .
Both (vii) and (viii) conclude that (G) and (H) hold.
(I) and (J): Let:
f 5 ( T ) = θ 2 T 2 e θ ( T M ) 2 θ T e θ ( T M ) + 2 e θ ( T M ) + 2 θ M 2
Then, Equation (A8) yields:
f 5 ( T ) = θ 3 T 2 e θ ( T M ) > 0   if   T > 0 .
Furthermore, Equation (A9) implies:
(ix) 
f 5 ( T ) is increasing on T > 0 .
(x) 
f 5 ( M ) = θ 2 M 2 > 0
Both (ix) and (x) conclude that (I) and (J) hold.
Incorporating the above arguments, we completed the proof of Lemma 1. □

Appendix A.2. Proof of Lemma 2

Proof. 
(A) Let:
F 1 ( T ) = A + D ( c θ + h ) θ 2 ( θ T e θ T e θ T + 1 ) + c I k D θ 2 ( θ T e θ ( T M ) e θ ( T M ) θ M + 1 ) + p I e D M 2 2 .
Then:
T R C 1 ( T ) = F 1 ( T ) T 2 .
Equation (A10) yields:
F 1 ( T ) = D T [ ( c θ + h ) e θ T + c I k e θ ( T M ) ] > 0 .
Therefore, F 1 ( T ) is increasing on T > 0 . Equations (31) and (A10) imply:
F 1 ( M ) = Δ 1 ,
and
lim T F 1 ( T ) = .
(i)
If Δ 1 > 0 , then:
F 1 ( T ) > F 1 ( M ) > 0   if   T > M .
Equation (A11) reveals T R C 1 ( T ) > 0 if T M . Therefore, T R C 1 ( T ) is increasing on [ M , ) .
(ii)
If Δ 1 0 , the Intermediate Value Theorem (Varberg et al. [41]) implies that there exists a unique point T ¯ 1 [ M , ) such that F 1 ( T ¯ 1 ) = 0 . Therefore, we have:
F 1 ( T ) { (A16a) < 0 i f 0 < T < T 1 ¯ , (A16b) = 0 i f T = T 1 ¯ , (A16c) > 0 i f T > T 1 ¯ .
Equation (A11) shows:
T R C 1 ( T ) { (A17a) < 0 i f 0 < T < T 1 ¯ , (A17b) = 0 i f T = T 1 ¯ , (A17c) > 0 i f T > T 1 ¯ .
Equations (A17a–c) demonstrates that T R C 1 ( T ) is decreasing on ( 0 , T ¯ 1 ] and increasing on [ T ¯ 1 , ) . Therefore, T = T ¯ 1 . Combining (i) and (ii), we completed the proof of (A).
(B) Let:
F 2 ( T ) = A + D ( c θ + h ) ( θ T e θ T e θ T + 1 ) θ 2 + p I e D T 2 2 .
Then:
T R C 2 ( T ) = F 2 ( T ) T 2 .
Equation (A18) yields:
F 1 ( T ) = D ( c θ + h ) T e θ T + p I e D T > 0 .
Therefore, F 2 ( T ) is increasing on T 0 . Equations (31), (32) and (A18) imply:
F 2 ( M ) = Δ 1 ,
F 2 ( T W ) = Δ 2 ,
and
lim T F 2 ( T ) = .
(i)
If Δ 2 > 0 , then:
F 2 ( T ) > F 2 ( T W )   if   T > T W .
Equation (A19) reveals T R C 2 ( T ) > 0 if T T W . Therefore, T R C 2 ( T ) is increasing on [ T W , ) .
(ii)
If Δ 2 0 < Δ 1 , the Intermediate Value Theorem (Varberg et al. [41]) implies that there exists a unique point T ¯ 2 [ T W , M ) such that F 2 ( T ¯ 2 ) = 0 . Therefore, we have:
F 2 ( T ) { (A25a) < 0 i f 0 < T < T 2 ¯ , (A25b) = 0 i f T = T 2 ¯ , (A25c) > 0 i f T > T 2 ¯ .
Equation (A19) shows:
T R C 2 ( T ) { (A26a) < 0 i f 0 < T < T 2 ¯ , (A26b) = 0 i f T = T 2 ¯ , (A26c) > 0 i f T > T 2 ¯ .
Equation (A26a–c) demonstrates that T R C 2 ( T ) is decreasing on ( 0 , T ¯ 2 ] and increasing on [ T ¯ 2 , ) . Therefore, T 2 = T 2 ¯ . Of course, T R C 2 ( T ) is decreasing on [ T W , T ¯ 2 ] and increasing on [ T ¯ 2 , M ] .
(iii)
If Δ 1 0 , then:
0 Δ 1 = F 2 ( M ) > F 2 ( T )   if   0 < T < M .
Equation (A19) reveals T R C 2 ( T ) < 0 if T W < T < M . Of course, T R C 2 ( T ) is decreasing on [ T W , M ] .
Combining (i)-(iii), we completed the proof of (B).
(C) Let:
F 3 ( T ) = A + D [ ( c θ + h ) + θ I e c ( 1 α ) M ] θ 2 ( θ T e θ T e θ T + 1 ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) + p I e D T 2 2
Then:
T R C 3 ( T ) = F 3 ( T ) T 2 .
Equation (A27) and Lemma 1(B) yield:
F 3 ( T ) = D [ ( c θ + h ) + θ I e c ( 1 α ) M ] ( T e θ T ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 × [ θ e θ T ( 2 θ T e θ T e θ T + 1 ) + ( e θ T 1 ) ( 2 θ 2 T e θ T + θ e θ T ) ] + p I e D T > 0 i f T > 0 .
Therefore, F 3 ( T ) is increasing on T 0 . Equations (33) and (A27) imply:
F 3 ( T W ) = Δ 3 ,
and
F 3 ( 0 ) = A < 0
(i)
If Δ 3 > 0 , the Intermediate Value Theorem (Varberg et al. [41]) concludes that there exists a unique point T ¯ 3 ( 0 , T W ) such that F 3 ( T ¯ 3 ) = 0 . Therefore, we have:
F 3 ( T ) { (A32a) < 0 i f 0 < T < T 3 ¯ , (A32b) = 0 i f T = T 3 ¯ , (A32c) > 0 i f T > T 3 ¯ .
Equation (A28) shows:
T R C 3 ( T ) { (A33a) < 0 i f 0 < T < T 3 ¯ , (A33b) = 0 i f T = T 3 ¯ , (A33c) > 0 i f T > T 3 ¯ .
Equation (A33a–c) demonstrates that T R C ( T 3 ) is decreasing on ( 0 , T ¯ 3 ] and increasing on [ T ¯ 3 , ) . Therefore, T 3 = T ¯ 3 . Of course, T R C ( T 3 ) is decreasing on ( 0 , T ¯ 3 ] and increasing on [ T ¯ 3 , T W ) .
(i)
If Δ 3 0 , then:
0 F 3 ( T W ) > F 3 ( T )   if   0 < T < T W .
Equation (A28) reveals T R C 3 ( T ) < 0 if 0 < T < T W . Therefore, T R C ( T 3 ) is decreasing on ( 0 , T W ) .
Incorporating the above arguments, we completed the proof of Lemma 2. □

Appendix A.3. Proof of Lemma 3

Proof. 
(A)
Since F 1 ( T W ) = Δ 4 , following the same arguments as those of Lemma 1 (A(i),(ii)), Lemma 2 (A(i),(ii)) holds.
(B)
Let:
F 4 ( T ) = A + D ( c θ + h ) θ 2 ( θ T e θ T e θ T + 1 ) + c I k D θ 2 ( θ T e θ ( T M ) e θ ( T M ) θ M + 1 ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D 2 θ 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) + p I e D M 2 2 + I e D ( 1 α ) c M θ ( θ T e θ T e θ T + 1 ) .
Then:
T R C 4 ( T ) = F 4 ( T ) T 2
Equation (A35) and Lemma 1(B) yield:
F 4 ( T ) = D ( c θ + h ) ( T e θ T ) + c I k D ( T e θ ( T M ) ) + ( c 2 p ) ( I k I e ) ( 1 α ) 2 D T e θ T ( 2 e θ T 1 ) + I e D c ( 1 α ) M ( θ T e θ T ) > 0
Therefore, F 4 ( T ) is increasing on T 0 . Equations (45) and (A35) imply:
F 4 ( M ) = Δ 5 ,
F 4 ( T W ) = Δ 6 ,
and
lim T F 4 ( T ) = .
(i)
If Δ 6 0 , then:
0 F 4 ( T W ) > F 4 ( T )   if   M T < T W .
Equation (A37) reveals T R C 4 ( T ) < 0 if M < T < T W . Therefore, T R C 4 ( T ) is decreasing on [ M , T W ) .
(ii)
If Δ 5 0 < Δ 6 , the Intermediate Value Theorem (Varberg et al. [41]) implies that there exists a unique point T ¯ 4 [ M , T W ) such that F 4 ( T ¯ 4 ) = 0 . Therefore, we have:
F 4 ( T ) { (A42a) < 0 i f 0 < T < T 4 ¯ , (A42b) = 0 i f T = T 4 ¯ , (A42c) > 0 i f T > T 4 ¯ .
Equation (A31) shows:
T R C 4 ( T ) { (A43a) < 0 i f 0 < T < T 4 ¯ , (A43b) = 0 i f T = T 4 ¯ , (A43c) > 0 i f T > T 4 ¯ .
Equation (A43a–c) demonstrates that T R C 4 ( T ) is decreasing on ( 0 , T ¯ 4 ] and increasing on [ T ¯ 4 , ) . Therefore, T = T 4 ¯ . Of course, Lemma 2 B(ii) holds.
(iii)
If Δ 5 > 0 , then:
F 4 ( T ) > F 4 ( M ) > 0   if   T > M .
Equation (40) reveals T R C 4 ( T ) > 0 if T > M . Therefore, T R C 4 ( T ) is increasing on [ M , ) .
(C)
The proof is the same as that of Lemma 2(C).
Incorporating the above arguments, we completed the proof of Lemma 3. □

Appendix A.4. Proof of Lemma 4

Proof. 
(A)
The proofs of (A)(i,ii) are the same as those of Lemma 3A(i,ii).
(B)
Let:
F 5 ( T ) = A + [ D c θ ( 1 I k α M ) + D h ] θ 2 ( θ T e θ T e θ T 1 ) + ( c 2 p ) I k D 2 θ 2 ( e θ T 1 ) ( 2 θ T e θ T e θ T + 1 ) .
Then:
T R C 5 ( T ) = F 5 ( T ) T 2
Since 1 I k α M > 0 in general, Equation (A38) yields:
F 5 ( T ) = [ D c θ ( 1 I k α M ) + D h ] T e θ T + ( c 2 p ) I k D T e θ T ( 2 e θ T 1 ) > 0 .
According to Equation (A47), F 5 ( T ) is increasing on T > 0 . Equations (53) and (54) imply:
F 5 ( T W ) = Δ 8 ,
F 5 ( T 0 ) = Δ 7 ,
and
lim T F 5 ( T ) = .
(i)
If Δ 7 0 , then:
F 5 ( T ) > F 5 ( T 0 ) = Δ 7 0   if   T > T 0 .
Equation (A46) reveals T R C 5 ( T ) > 0 if T > T 0 . Therefore, T R C 5 ( T ) is increasing on [ T 0 , ) .
(ii)
If Δ 7 < 0 < Δ 8 , the Intermediate Value Theorem (Varberg et al. [41]) implies that there exists a unique point T ¯ 5 ( T 0 , T W ) such that F 5 ( T ¯ 5 ) = 0 . Therefore, we have:
F 5 ( T ) { (A52a) < 0 i f 0 < T < T 5 ¯ , (A52b) = 0 i f T = T 5 ¯ , (A52c) > 0 i f T > T 5 ¯ .
Equation (A46) shows:
T R C 5 ( T ) { (A53a) < 0 i f 0 < T < T 5 ¯ , (A53b) = 0 i f T = T 5 ¯ , (A53c) > 0 i f T > T 5 ¯ .
Equation (A53a–c) demonstrates that T R C 5 ( T ) is decreasing on ( 0 , T ¯ 5 ] and increasing on [ T ¯ 5 , ) . Therefore, T 5 = T ¯ 5 . Of course, Lemma 4 B(ii) holds.
(iii)
If Δ 8 0 , then:
0 Δ 8 = F 5 ( T W ) > F 5 ( T )   if   0 < T < T W .
Equation (A46) reveals T R C 5 ( T ) < 0 if 0 < T < T W . Of course, T R C 5 ( T ) is decreasing on ( T 0 , T W ) .
(C)
 
(i)
The proof is the same as that of Lemma 3 B(iii).
(ii)
Equations (43), (A35) and (55) imply:
F 4 ( M ) = Δ 5 ,
F 4 ( T 0 ) = Δ 9 ,
and
lim T F 4 ( T ) = .
If Δ 5 0 < Δ 9 , the Intermediate Value Theorem (Varberg et al. [41]) implies that there exists a unique point T ˜ 4 [ M , T 0 ] such that F 4 ( T ˜ 4 ) = 0 . Therefore, we have
F 4 ( T ) { (A58a) < 0 i f 0 < T < T 4 ˜ , (A58b) = 0 i f T = T 4 ˜ , (A58c) > 0 i f T > T 4 ˜ .
Equation (A36) shows:
T R C 4 ( T ) { (A59a) < 0 i f 0 < T < T 4 ˜ , (A59b) = 0 i f T = T 4 ˜ , (A59c) > 0 i f T > T 4 ˜ .
According to Equation (A59a–c), we have that T R C 4 ( T ) is decreasing on ( 0 , T ˜ 4 ] and increasing on [ T ˜ 4 , ) . Therefore, T 4 = T ˜ 4 . Of course, T R C 4 ( T ) is decreasing on [ M , T 4 ] and increasing on [ T 4 , T 0 ] .
(i)
If Δ 9 0 , then:
0 = Δ 9 = F 4 ( T 0 ) > F 4 ( T )   if   0 < T < T 0 .
Equation (A36) reveals T R C 4 ( T ) < 0 if 0 < T < T 0 . Of course, T R C 4 ( T ) is decreasing on [ M , T 0 ] .
(D)
The proof is the same as that of Lemma 2(C).
Incorporating the above arguments, we completed the proof of Lemma 4. □

Appendix A.5. Proof of Theorem 2

Proof. 
(A)
If Δ 1 0 and Δ 3 0 , then Δ 1 0 , Δ 2 0 and Δ 3 0 . With Lemma 2 (A(ii), B(iii), C(ii)), we have:
(a1)
T R C 3 ( T ) is decreasing on ( 0 , T W ) .
(a2)
T R C 2 ( T ) is decreasing on [ T W , M ] .
(a3)
T R C 1 ( T ) is decreasing on [ M , T 1 ] and increasing on [ T 1 , ) .
Then, (a1)–(a3) and Equation (13a–c) imply T * = T 1 and T R C ( T * ) = T R C 1 ( T 1 ) .
(B)
If Δ 1 0 and Δ 3 > 0 , then Δ 1 0 , Δ 2 < 0 and Δ 3 > 0 . With Lemma 2(A(ii), B(iii), C(i)), we have:
(b1)
T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , T W ) .
(b2)
T R C 2 ( T ) is decreasing on [ T W , M ] .
(b3)
T R C 1 ( T ) is decreasing on [ M , T 1 ] and increasing on [ T 1 , ) .
Then, (b1)–(b3) and Equation (13a–c) imply T R C ( T * ) = min { T R C 1 ( T 1 ) , T R C 3 ( T 3 ) } and T * = T 1 or T 3 associated with the least cost.
(C)
If Δ 1 > 0 , Δ 2 0 and Δ 3 > 0 , with Lemma 2(A(i), B(ii), C(i)), we have:
(c1)
T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , T W ) .
(c2)
T R C 2 ( T ) is decreasing on [ T W , T 2 ] and increasing on [ T 2 , M ] .
(c3)
T R C 1 ( T ) is increasing on [ M , ) .
Then, (c1)–(c3) and Equation (13a–c) imply:
T R C ( T * ) = min { T R C 3 ( T 3 ) , T R C 2 ( T 2 ) }
Since 0 < T 3 < T 2 < M , Equation (11) implies:
T R C 3 ( T 3 ) > T R C 2 ( T 3 ) > T R C 2 ( T 2 ) .
Equations (A61) and (A62) yield T R C ( T * ) = T R C 2 ( T 2 ) and T * = T 2 .
(D)
If Δ 2 > 0 , then Δ 1 > 0 , Δ 2 > 0 and Δ 3 > 0 . With Lemma 2(A(i), B(i), C(i)), we have:
(d1)
T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , T W ) .
(d2)
T R C 2 ( T ) is increasing on [ T W , M ] .
(d3)
T R C 1 ( T ) is increasing on [ M , ) .
Then, (d1)–(d3) and Equation (13a–c) imply T R C ( T * ) = min { T R C 2 ( T W ) , T R C 3 ( T 3 ) } and T * = T W or T 3 associated with the least cost.
(E)
If Δ 1 > 0 and Δ 3 0 , then Δ 1 > 0 , Δ 2 0 and Δ 3 0 . With Lemma 2(A(i), B(ii), C(ii)), we have:
(e1)
T R C 3 ( T ) is decreasing on ( 0 , T W ] .
(e2)
T R C 2 ( T ) is decreasing on [ T W , T 2 ] and increasing on [ T 2 , M ] .
(e3)
T R C 1 ( T ) is increasing on [ M , ) .
Then, (e1)–(e3) and Equation (13a–c) imply T R C ( T * ) = T R C 2 ( T 2 ) and T * = T 2 .
Incorporating (A)–(E), we completed the proof of Theorem 2. □

Appendix A.6. Proof of Theorem 4

Proof. 
 
(A(a1)) If Δ 4 > 0 , Δ 5 > 0 and Δ 7 0 , then Equations (56) and (57) imply Δ 4 > 0 , Δ 5 > 0 , Δ 7 0 , Δ 8 > 0 and Δ 9 > 0 With Lemma 49A(i), B(i), C(i), D(i)), we have:
(a11) T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , M ] .
(a12) T R C 4 ( T ) is increasing on [ M , T 0 ] .
(a13) T R C 5 ( T ) is increasing on ( T 0 , T W ) .
(a14) T R C 1 ( T ) is increasing on [ T W , ) .
(a11–a14), Equations (16), (60) and (61) reveal T R C ( T * ) = T R C 3 ( T 3 ) .
(A(a2)–A(a3)) Similar to the approach used in (A(a1)), it can be shown that (A(a2)-A(a3)) hold.
(B(b1)) If Δ 4 > 0 , Δ 5 > 0 and Δ 7 < 0 < Δ 8 , then Δ 4 > 0 , Δ 5 > 0 , Δ 7 < 0 , Δ 8 > 0 and Δ 9 > 0 . With Lemma 4(A(i), B(ii), C(i), D(i)), we have:
(b11) T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , M ] .
(b12) T R C 4 ( T ) is increasing on [ M , T 0 ] .
(b13) T R C 5 ( T ) is decreasing on ( T 0 , T 5 ] and increasing on ( T 5 , T W ) .
(b14) T R C 1 ( T ) is increasing on [ T W , ) .
(b11)–(b14), Equations (16), (60) and (61) reveal T R C ( T * ) = min { T R C 3 ( T 3 ) , T R C 5 ( T 5 ) } .
(B(b2)–(b4)) Similar to the approach used in (B(b1)), it can be shown that (B(b2)–(b4)) hold.
(C(c1)) If Δ 4 > 0 , Δ 5 > 0 and Δ 8 0 , then Δ 4 > 0 , Δ 5 > 0 , Δ 7 < 0 , Δ 8 0 and Δ 9 > 0 . With Lemma 4(A(i), B(iii), C(i), D(i)0, we have:
(c11) T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , M ] .
(c12) T R C 4 ( T ) is increasing on [ M , T 0 ] .
(c13) T R C 5 ( T ) is decreasing on ( T 0 , T W ) .
(c14) T R C 1 ( T ) is increasing on [ T W , ) .
(c11)–(c14), Equations (16), (60) and (61) reveal that there are two cases to occur:
(i)
If T R C 5 ( T W ) T R C 3 ( T 3 ) , then T R C ( T * ) = T R C 3 ( T 3 ) .
(ii)
If T R C 5 ( T W ) < T R C 3 ( T 3 ) , then T * does not exist.
(C(c2)–(c4)) Similar to the approach used in (C(c1)), it can be shown that (C(c2)–(c4)) hold.
(D(d1)–(d4)) Similar to the approach used in (A(a1)–(a4))), it can be shown that (D(d1)–(d4)) hold.
(E(e1)–(e4)) Similar to the approach used in (B(b1)–(b4)), it can be shown that (E(e1)–(e4)) hold.
(F(f1)–(f4)) Similar to the approach used in (C(c1)–(c4)), it can be shown that (F(f1)–(f4)) hold.
(G(g1)–(g4)) Similar to the approach used in (A(a1)–(a4)), it can be shown that (G(g1)–(g4)) hold.
(H(h1)–(h4)) Similar to the approach used in (B(b1)–(b4)), it can be shown that (H(h1)–(h4)) hold.
(I(i1)–(i4)) Similar to the approach used in (C(c1)–(c4)), it can be shown that (I(i1)–(i4)) hold.
(J(j1)–(j4)) Similar to the approach used in (B(b1)–(b4)), it can be shown that (J(j1)–(j4)) hold.
(K(k1)) If Δ 4 0 , Δ 5 > 0 and Δ 7 < 0 < Δ 8 , then Δ 4 0 , Δ 5 > 0 , Δ 7 < 0 < Δ 8 and Δ 9 > 0 . With Lemma 4(A(ii), B(ii), C(i), D(i)), we have:
(k11) T R C 3 ( T ) is decreasing on ( 0 , T 3 ] and increasing on [ T 3 , M ] .
(k12) T R C 4 ( T ) is increasing on [ M , T 0 ] .
(k13) T R C 5 ( T ) is decreasing on ( T 0 , T 5 ] and increasing on [ T 5 , T W ) .
(k14) T R C 1 ( T ) is decreasing on [ T W , T 1 ] and increasing on [ T 1 , ) .
(k11)–(k14), Equations (16), (60) and (61) reveal T R C ( T * ) = min { T R C 3 ( T 3 ) , T R C 5 ( T 5 ) , T R C 1 ( T 1 ) } .
(K(k2)–(k4)) Similar to the approach used in (K(k1)), it can be shown that (K(k2)–(k4)) hold.
(L(l1)–(l4)) Similar to the approach used in (C(c1)–(c4)), it can be shown that (L(l1)–(l4)) hold.
(M(m1)–(m4)) Similar to the approach used in (B(b1)–(b4)), it can be shown that (M(m1)–(m4)) hold.
(N(n1)–(n4)) Similar to the approach used in (K(k1)–(k4)), it can be shown that (N(n1)–(n4)) hold.
(O(o1)–(o4)) Similar to the approach used in (C(c1)–(c4)), it can be shown that (O(o1)–(o4)) hold.
(P(p1)–(p4)) Similar to the approach used in (B(b1)–(b4)), it can be shown that (P(p1)–(p4)) hold.
(Q(q1)–(q4)) Similar to the approach used in (K(k1)–(k4)), it can be shown that (Q(q1)–(q4)) hold.
(R(r1)–(r4)) Similar to the approach used in (C(c1)–(c4)), it can be shown that (R(r1)–(r4)) hold.
Incorporating (A)–(R), we completed the proof of Theorem 4. □

References

  1. Whitin, T.M. Theory of Inventory Management; Princeton University Press: Princeton, NJ, USA, 1957; pp. 62–72. [Google Scholar]
  2. Ghare, P.M.; Schrader, G.F. A model for exponentially decaying inventories. J. Ind. Eng. 1963, 15, 238–243. [Google Scholar]
  3. Nahmias, S. Perishable Inventory Theory: A Review. Oper. Res. 1982, 30, 680–708. [Google Scholar] [CrossRef] [PubMed]
  4. Raafat, R. Survey of literature on continuously deteriorating inventory model. J. Oper. Res. Soc. 1991, 42, 27–37. [Google Scholar] [CrossRef]
  5. Goyal, S.; Giri, B. Recent trends in modeling of deteriorating inventory. Eur. J. Oper. Res. 2001, 134, 1–16. [Google Scholar] [CrossRef]
  6. Bakker, M.; Riezebos, J.; Teunter, R.H. Review of inventory systems with deterioration since 2001. Eur. J. Oper. Res. 2012, 221, 275–284. [Google Scholar] [CrossRef]
  7. Mahata, G.C. Optimal ordering policy with trade credit and variable deterioration for fixed life time products. Int. J. Oper. Res. 2015, 25, 307–326. [Google Scholar] [CrossRef]
  8. Janssen, L.; Claus, T.; Sauer, J. Literature review of deteriorating inventory models by key topics from 2012 to 2015. Int. J. Prod. Econ. 2016, 182, 86–112. [Google Scholar] [CrossRef] [Green Version]
  9. Haley, C.W.; Higgins, R.C. Inventory Policy and Trade Credit Financing. Manag. Sci. 1973, 20, 464–471. [Google Scholar] [CrossRef]
  10. Goyal, S.K. Economic Order Quantity under Conditions of Permissible Delay in Payments. J. Oper. Res. Soc. 1985, 36, 335. [Google Scholar] [CrossRef]
  11. Chang, C.-T.; Teng, J.-T.; Goyal, S.K. Inventory lot-size models under trade credit: A review. Asia-Pac. J. Oper. Res. 2008, 25, 89–112. [Google Scholar] [CrossRef]
  12. Stokes, J.R. Dynamic cash discounts when sales volume is stochastic. Q. Rev. Econ. Financ. 2005, 45, 144–160. [Google Scholar] [CrossRef]
  13. Khouja, M.; Mehrez, A. Optimal inventory policy under different supplier credit policies. J. Manuf. Syst. 1996, 15, 334–339. [Google Scholar] [CrossRef]
  14. Chang, C.-T.; Ouyang, L.-Y.; Teng, J.-T. An EOQ model with deteriorating items under inflation when supplier credits linked to order quantity. Appl. Math. Model. 2003, 27, 983–996. [Google Scholar] [CrossRef]
  15. Liao, J.-J. A note on an EOQ model for deteriorating items under supplier credit linked to ordering quantity. Appl. Math. Model. 2007, 31, 1690–1699. [Google Scholar] [CrossRef]
  16. Chung, K.-J. An accurate and reliable solution procedure for the EOQ model with deteriorating items under supplier credits linked to the ordering quantity. Comput. Ind. Eng. 2009, 56, 1715–1720. [Google Scholar] [CrossRef]
  17. Chung, K.-J. The correct process of arguments of the solution procedure on the inventory model for deteriorating items with trapezoidal type demand rate in supply chain management. Appl. Math. Lett. 2012, 25, 1901–1905. [Google Scholar] [CrossRef] [Green Version]
  18. Chung, K.-J.; Liao, J.-J.; Ting, P.-S.; Lin, S.-D.; Srivastava, H.M. A unified presentation of inventory models under quantity discounts, trade credits and cash discounts in the supply chain management. Rev. Real Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. 2018, 112, 509–538. [Google Scholar] [CrossRef]
  19. Chang, C.-T.; Cheng, M.-C.; Ouyang, L.-Y. Optimal pricing and ordering policies for non-instantaneously deteriorating items under order-size-dependent delay in payments. Appl. Math. Model. 2015, 39, 747–763. [Google Scholar] [CrossRef]
  20. Liao, J.; Huang, K.; Chung, K.; Lin, S.; Ting, P.; Srivastava, H.M. Retailer’s optimal ordering policy in the EOQ model with imperfect-quality items under limited storage capacity and permissible delay. Math. Methods Appl. Sci. 2018, 41, 7624–7640. [Google Scholar] [CrossRef]
  21. Huang, Y.-F. Economic order quantity under conditionally permissible delay in payments. Eur. J. Oper. Res. 2007, 176, 911–924. [Google Scholar] [CrossRef]
  22. Yang, C.-T. The optimal order and payment policies for deteriorating items in discount cash and payment policies for deteri-orating items in discount cash flows analysis under the alternatives of conditionally permissible delay in payments and cash discount. TOP 2010, 18, 429–443. [Google Scholar] [CrossRef]
  23. Ouyang, L.-Y.; Teng, J.-T.; Goyal, S.K.; Yang, C.-T. An economic order quantity model for deteriorating items with partially permissible delay in payments linked to order quantity. Eur. J. Oper. Res. 2009, 194, 418–431. [Google Scholar] [CrossRef]
  24. Liao, J.-J.; Huang, K.-N.; Chung, K.-J.; Lin, S.-D.; Chuang, S.-T.; Srivastava, H.M. Optimal ordering policy in an economic order quantity (EOQ) model for non-instantaneous deteriorating items with defective quality and permissible delay in payments. RACSAM REV R ACAD A. (RACSAM) 2020, 114, 41. [Google Scholar] [CrossRef]
  25. Taleizadeh, A.A.; Pentico, D.W.; Jabalameli, M.S.; Aryanezhad, M. An economic order quantity model with multiple partial prepayments and partial backordering. Math. Comput. Model. 2013, 57, 311–323. [Google Scholar] [CrossRef]
  26. Lashgari, M.; Taleizadeh, A.A.; Sana, S.S. An inventory control problem for deteriorating items with back-ordering and fi-nancial considerations under two levels of trade credit linked to order quantity. J. Ind. Manag. Optim. 2016, 12, 1091–1119. [Google Scholar] [CrossRef] [Green Version]
  27. Taleizadeh, A.A. Lot-sizing model with advance payment pricing and disruption in supply under planned partial backordering. Int. Trans. Oper. Res. 2016, 24, 783–800. [Google Scholar] [CrossRef]
  28. Tiwari, S.; Wee, H.M.; Sarkar, S. Lot-sizing policies for defective and deteriorating items with time-dependent demand and trade credit. Eur. J. Ind. Eng. 2017, 11, 683. [Google Scholar] [CrossRef]
  29. Chang, C.-T.; Ouyang, L.-Y.; Teng, J.-T.; Lai, K.-K.; Cárdenas-Barrón, L.E. Manufacturer’s pricing and lot-sizing decisions for perishable goods under various payment terms by a discounted cash flow analysis. Int. J. Prod. Econ. 2019, 218, 83–95. [Google Scholar] [CrossRef]
  30. Li, R.; Liu, Y.; Teng, J.-T.; Tsao, Y.-C. Optimal pricing, lot-sizing and backordering decisions when a seller demands an advance-cash-credit payment scheme. Eur. J. Oper. Res. 2019, 278, 283–295. [Google Scholar] [CrossRef]
  31. Tiwari, S.; Cárdenas-Barrón, L.E.; Shaikh, A.A.; Goh, M. Retailer’s optimal ordering policy for deteriorating items under or-der-size dependent trade credit and complete backlogging. Comput. Ind. Eng. 2020, 139, 105559. [Google Scholar] [CrossRef]
  32. Chung, K.-J.; Liao, J.-J.; Lin, S.-D.; Chuang, S.-T.; Srivastava, H.M. Mathematical analytic techniques and the complete squares method for solving an inventory modelling problem with a mixture of backorders and lost sales. Rev. Real Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. 2019, 114, 28. [Google Scholar] [CrossRef]
  33. Leung, K.-N.F. Technical note: A use of the complete squares method to solve and analyze a quadratic objective function with two decision variables exemplified via a deterministic inventory model with a mixture of backorders and lost sales. Int. J. Prod. Econ. 2008, 113, 275–281. [Google Scholar] [CrossRef]
  34. Chung, K.-J.; Liao, J.-J.; Lin, S.-D.; Chuang, S.-T.; Srivastava, H.M. The inventory model for deteriorating items under condi-tions involving cash discount and trade credit. Mathematics 2019, 7, 596. [Google Scholar] [CrossRef] [Green Version]
  35. Chang, C.-T.; Teng, J.-T. Retailer’s optimal ordering policy under supplier credits. Math. Methods Oper. Res. 2004, 60, 471–483. [Google Scholar] [CrossRef]
  36. Srivastava, H.M.; Chung, K.; Liao, J.; Lin, S.; Chuang, S. Some modified mathematical analytic derivations of the annual total relevant cost of the inventory model with two levels of trade credit in the supply chain system. Math. Methods Appl. Sci. 2019, 42, 3967–3977. [Google Scholar] [CrossRef]
  37. Teng, J.-T.; Cárdenas-Barrón, L.E.; Chang, H.-J.; Wu, J.; Hu, Y. Inventory lot-size policies for deteriorating items with expiration dates and advance payments. Appl. Math. Model. 2016, 40, 8605–8616. [Google Scholar] [CrossRef]
  38. Teng, J.-T.; Ouyang, L.-Y.; Chen, L.-H. Optimal manufacturer’s pricing and lot-sizing policies under trade credit financing. Int. Trans. Oper. Res. 2006, 13, 515–528. [Google Scholar] [CrossRef]
  39. Chung, K.-J.; Liao, J.-J.; Lin, S.-D.; Chuang, S.-T.; Srivastava, H.M. Manufacturer’s optimal pricing and lot-sizing policies under trade-credit financing. Math. Methods Appl. Sci. 2020, 43, 3099–3116. [Google Scholar] [CrossRef]
  40. Ting, P.-S. Comments on the EOQ model for deteriorating items with conditional trade credit linked to order quantity in the supply chain management. Eur. J. Oper. Res. 2015, 246, 108–118. [Google Scholar] [CrossRef]
  41. Varberg, D.; Purcell, E.J.; Steven, S.E. Calculus, 9th ed.; Pearson Education: Upper Saddle River, NJ, USA, 2007. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Chung, K.-J.; Liao, J.-J.; Srivastava, H.M.; Lee, S.-F.; Lin, S.-D. The EOQ Model for Deteriorating Items with a Conditional Trade Credit Linked to Order Quantity in a Supply Chain System. Mathematics 2021, 9, 2311. https://0-doi-org.brum.beds.ac.uk/10.3390/math9182311

AMA Style

Chung K-J, Liao J-J, Srivastava HM, Lee S-F, Lin S-D. The EOQ Model for Deteriorating Items with a Conditional Trade Credit Linked to Order Quantity in a Supply Chain System. Mathematics. 2021; 9(18):2311. https://0-doi-org.brum.beds.ac.uk/10.3390/math9182311

Chicago/Turabian Style

Chung, Kun-Jen, Jui-Jung Liao, Hari Mohan Srivastava, Shih-Fang Lee, and Shy-Der Lin. 2021. "The EOQ Model for Deteriorating Items with a Conditional Trade Credit Linked to Order Quantity in a Supply Chain System" Mathematics 9, no. 18: 2311. https://0-doi-org.brum.beds.ac.uk/10.3390/math9182311

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