Abstract
Applications of optimization methods to production and inventory problems date back at least to the classical EOQ (Economic Order Quantity) model or the lot size formula of Harris (1913) . The EOQ is essentially a static model in the sense that the demand is constant and only a stationary solution is sought. A dynamic version of the lot size model was analyzed by Wagner and Whitin (1958) . The solution methodology used there was dynamic programming.
Access provided by Autonomous University of Puebla. Download chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Applications of optimization methods to production and inventory problems date back at least to the classical EOQ (Economic Order Quantity) model or the lot size formula of Harris (1913) . The EOQ is essentially a static model in the sense that the demand is constant and only a stationary solution is sought. A dynamic version of the lot size model was analyzed by Wagner and Whitin (1958) . The solution methodology used there was dynamic programming.
An important dynamic production planning model was developed by Holt et al. (1960) . In their model, referred to as the HMMS model , they considered both production costs and inventory holding costs over time. They used calculus of variations techniques to solve the continuous-time version of their model. In Sect. 6.1, a model of Thompson and Sethi (1980) , similar to the HMMS model, is formulated and completely solved using optimal control theory. The turnpike solution is also obtained when the horizon is infinite.
In Sect. 6.2, we introduce the wheat trading model of Ijiri and Thompson (1970) , in which a wheat speculator must buy and sell wheat in an optimal way in order to take advantage of changes in the price of wheat over time. In Sects. 6.2.1–6.2.3, we solve the model when the short-selling of wheat is allowed. In Sect. 6.2.4, we follow Norström (1978) to solve a simple example that disallows short-selling.
In Sect. 6.3, we introduce a warehousing constraint, i.e., an upper bound on the amount of wheat that can be stored, in the wheat trading model. In addition to being realistic, the introduction of the warehousing constraint helps us to illustrate the concepts of decision and forecast horizons by means of examples. This section is expository in nature, but theoretical developments of these ideas are available in the literature.
6.1 Production-Inventory Systems
Many manufacturing enterprises use a production-inventory system to manage fluctuations in consumer demand for their products. Such a system consists of a manufacturing plant and a finished goods warehouse to store products which are manufactured but not immediately sold. Once a product is made and put into inventory, it incurs inventory holding costs of two kinds: (1) costs of physically storing the product, insuring it, etc.; and (2) opportunity cost of having the firm’s money invested or tied up in the unsold inventory. The advantages of having products in inventory are: first, that they are immediately available to meet demand; second, that excess production during low demand periods can be stored in the warehouse so it will be available for sale during high demand periods. This usually permits the use of a smaller manufacturing plant than would otherwise be necessary, and also reduces the difficulties of managing the system.
The optimization problem is to balance the benefits of production smoothing versus the costs of holding inventory. Works that apply control theory to production and inventory problems have been reviewed in Sethi (1978a, 1984) .
6.1.1 The Production-Inventory Model
We consider a factory producing a single homogeneous good and having a finished goods warehouse. To state the model we define the following quantities:
The interpretation of the inventory goal level \(\hat{I}\) is that it is a safety stock that the company wants to keep on hand. For example, \(\hat{I}\) could be 2 months of average sales or \(\hat{I}\) could be 100 units of the finished goods. Similarly, the production goal level \(\hat{P}\) can be interpreted as the most efficient level at which it is desired to run the factory.
With this notation, the state equation is given by the stock-flow differential equation
which says that the inventory at time t is increased by the production rate and decreased by the sales rate. The objective function of the model is:
The interpretation of the objective function is that we want to keep the inventory as close as possible to its goal level \(\hat{I},\) and also to keep the production rate P as close as possible to its goal level \(\hat{P}.\) The quadratic terms \((h/2)(I -\hat{ I})^{2}\) and \((c/2)(P -\hat{ P})^{2}\) impose “penalties” for having either I or P not being close to its corresponding goal level.
Next we apply the maximum principle to solve the optimal control problem specified by (6.1) and (6.2). A stochastic extension of this problem will be carried out in Sect. 12.2.
6.1.2 Solution by the Maximum Principle
We now associate an adjoint function λ with Eq. (6.1) and can write the current-value Hamiltonian function as
In (6.3), we have used the negative of the (undiscounted) integrand in (6.2), since the minimization of J in (6.2) is equivalent to the maximization of − J.
To apply the Pontryagin maximum principle, we differentiate (6.3) and set the resulting expression equal to 0, which gives
From this we obtain the optimal production rate
We should mention that in writing (6.5), we are allowing negative production (or disposal). Of course, the situation of a disposal will not arise if we assume a sufficiently large \(\hat{P}\) and a sufficiently small I 0.
Remark 6.1
If P is constrained to be nonnegative, then the form of the optimal control will be
This case will be treated in Sect. 6.1.6.
By substituting (6.5) into (6.1), we obtain
The equation for the adjoint variable is easily found to be
We see that (6.7) has the initial boundary specified and (6.8) has the terminal boundary specified, so together these give a two-point boundary value problem. We will employ a method to solve these two equations simultaneously, which works only in some special cases including the present case. The method is the well-known trick used to solve simultaneous differential equations by differentiation and substitution until one of the variables is eliminated. Specifically, we differentiate (6.7) with respect to t, which creates an equation with \(\dot{\lambda }\) in it. We then use (6.8) to eliminate \(\dot{\lambda }\) and (6.7) to eliminate λ from the resulting equation as follows:
We rewrite this as
where the constant α is given by
We can now solve (6.9) by using the standard method described in Appendix A. The auxiliary equation for (6.9) is
which has the two real roots
note that m 1 < 0 and m 2 > 0. We can therefore write the general solution to (6.9) as
where Q(t) is a particular integral of (6.9).
We will say that Q(t) is a special particular integral of (6.9) if it has no additive terms involving \(e^{m_{1}t}\) and \(e^{m_{2}t}.\) From now on we will always assume that Q(t) is a special particular integral.
Although (6.12) has two arbitrary constants a 1 and a 2, it has only one boundary condition. To get the other boundary condition we differentiate (6.12), substitute the result into (6.7), and solve for λ. We obtain
Note that we have imposed the boundary condition on λ so that we can determine the constants a 1 and a 2.
For ease of expressing a 1 and a 2, let us define two constants
We now impose the boundary conditions in (6.12) and (6.13) and solve for a 1 and a 2 as follows:
If we recall that m 1 is negative and m 2 is positive, then when T is sufficiently large so that \(e^{m_{1}T}\) and \(e^{2m_{1}T}\) are negligible, we can write
Note that for a large T, \(e^{-m_{2}T}\) is close to zero and, therefore, a 2 is close to zero. However, the reason for retaining the exponential term in (6.19) is that a 2 is multiplied by \(e^{m_{2}t}\) in (6.13), which, while small when t is small, becomes large and important when t is close to T.
With these values of a 1 and a 2 and with (6.5), (6.12), and (6.13), we now write the expressions for I ∗, P ∗, and λ. We will break each expression into three parts: the first part labeled Starting Correction is important only when t is small; the second part labeled Turnpike Expression is significant for all values of t; and the third part labeled Ending Correction is important only when t is close to T.
Note that if b 1 = 0, which by (6.14) means I 0 = Q(0), then there is no starting correction. In other words, I 0 = Q(0) is a starting inventory that causes the solution to be on the turnpike initially. In the same way, if b 2 = 0, then the ending correction vanishes in each of these formulas, and the solution stays on the turnpike until the end.
Expressions (6.20) and (6.21) represent approximate closed-form solutions for the optimal inventory and production functions I ∗ and P ∗ as long as S is such that the special particular integral Q can be found explicitly. For such examples of S; see Sect. 6.1.4.
6.1.3 The Infinite Horizon Solution
It is important to show that this solution also makes sense when T → ∞. In this case it is usual to assume that the discount rate ρ > 0 and the sales rate S does not grow too fast so that the objective function (6.2) remains finite. One can then show that the limit of the finite horizon solution as T → ∞ also solves the infinite horizon problem. Note that as T → ∞, the ending correction terms in (6.20)–(6.22) disappear because \(e^{-m_{2}T}\) goes to 0. We now have
Since we would like
we would require that \(S +\dot{ Q}\) grows slower asymptotically than the discount rate ρ. One can easily verify that this condition holds for the demand terms discussed in Sect. 6.1.4 that follows. Moreover, the condition is easy to check for any given specific demand S(t) for which the particular integral Q(t) is known.
By the sufficiency of the maximum principle conditions (Sect. 2.4), it can be verified that the limiting solution
is optimal. If I(0) = Q(0), the solution is always on the turnpike. Note that the triple \(\{\bar{I},\bar{P},\bar{\lambda }\}=\{ Q,\dot{Q} + S,c(\dot{Q} + S -\hat{ P})\}\) represents a nonstationary turnpike. If I(0) ≠ Q(0), then b 1 ≠ 0 and the expressions (6.25) imply that the paths of inventory and production only approach the turnpike but never attain it.
6.1.4 Special Cases of Time Varying Demands
In this section, we provide some important cases of time varying demands including seasonal demands. These involve polynomial or sinusoidal demand functions. We then solve some numerical examples of the model described in Sect. 6.1.1 for ρ = 0 and T < ∞.
For the first example, we assume that S(t) is a polynomial of degree 2p or 2p − 1 so that S (2p+1) = 0, where S (k) denotes the kth time derivative of S with respect to t. In other words,
where at least one of C 0 and C 1 is not zero. Then, from Zwillinger (2003) , a particular integral of (6.9) is
In Exercise 6.2 the reader is asked to verify this by direct substitution.
For the second example, we assume that S(t) is a sinusoidal demand function of form
where A, B, C, and D are constants. In Exercise 6.3 you are asked to verify that a particular integral of (6.9) for S in (6.28) is
It is well known in the theory of differential equations that demands that are sums of functions of the form (6.26) and/or (6.28) give rise to solutions that are sums of functions of form (6.27) and/or (6.29).
Example 6.1
Assume \(\hat{P} = 30,\ \hat{I} = 15,\ T = 8,\ \rho = 0,\mbox{ and }\ h = c = 1\) so that α = 1, m 1 = −1, and m 2 = 1. Assume
Solution It is then easy to show from (6.27) that
Also from (6.14), (6.15), and (6.16), we have a 1 ≈ b 1 = I 0 − 53 and b 2 = −24. Then, from (6.20) and (6.21),
In Fig. 6.1 the graphs of sales, production, and inventory are drawn with I 0 = 10 (a small starting inventory), which makes b 1 = −43. In Fig. 6.2 the same graphs are drawn with I 0 = 50 (a large starting inventory), which makes b 1 = −3. In Fig. 6.3 the same graphs are drawn with I 0 = 30, which makes b 1 = −23. Note that initially during the time from 0 to 4, the three cases are quite different, but during the time from 4 to 8, they are nearly identical. The ending inventory ends up being 29 in all three cases.
Example 6.2
Assume that
where the constants A, B, C k, D k, and E k are estimated from future demand data by means of one of the standard forecasting techniques such as those in Brown (1959, 1963) .
Solution By using formulas (6.27) and (6.29), we obtain the particular integral
6.1.5 Optimality of a Linear Decision Rule
In Sect. 6.1.2, our emphasis was to explore the turnpike nature of the solution of the inventory model of Sect. 6.1.1. For this purpose, we made some asymptotic approximations when solving the state and adjoint differential equations under the assumption that the horizon is long. Here our focus is to solve the undiscounted version (i.e., ρ = 0) of the model exactly to find its optimal feedback solution, and show that it is a linear decision rule as reported in the classical work of Holt et al. (1960) .
Since the two-point boundary value problem given by (6.7) and (6.8) is a linear system of differential equations, it is known via its fundamental solution matrix that λ can be expressed in terms of I in a linear way as follows:
where ψ(t) and s(t) are continuously differentiable in t. Differentiating (6.32) with respect to t and substituting for \(\dot{I}\) and \(\dot{\lambda }\) from (6.7) and (6.8) with ρ = 0, respectively, we obtain
Since the above relation must hold for any value of the initial inventory I 0, we must have
Also from λ(T) = 0 in (6.8) and (6.32), we have 0 = ψ(T) − s(T)I(T), a relation that must hold regardless of the value of I(T). Thus, we can conclude that
Clearly, the solution of the differential equation given by (6.33) and (6.34) will give us the optimal control (6.5) in terms of S(t) and ψ(t). In particular, the differential equation
is known as the Riccati equation, whose solution is given by
Using (6.32) and (6.36) in (6.5), the optimal production rate P ∗(t) is
This says that the optimal production rate equals the production goal level \(\hat{P}\) plus two adjustment terms. The first term implies ceteris paribus that the higher the current inventory level, the lower the production rate is. Furthermore, this dependence is linear with the linear effect decreasing as t increases, reaching zero at t = T. The second term depends on all the model parameters including the demand rate from time t to T.
Because of the linear dependence of the optimal production rate on the inventory level in (6.37), this rule is known as a linear decision rule as reported by Holt et al. (1960) . More generally, this rule can be extended to linear quadratic problems as listed in Table 3.3(c). In Appendix D.4, we derive this rule for the problems given in Table 3.3(c), but without the forcing function d. Furthermore, the rule can be extended to a class of stochastic linear-quadratic problems that include the stochastic production planning problem treated in Sect. 12.2.
6.1.6 Analysis with a Nonnegative Production Constraint
Thus far in this chapter, we have ignored the production constraint P ≥ 0 and used (6.5) and (6.37) as the optimal decision rules. Here we will solve the production-inventory problem subject to P ≥ 0, and use (6.6) as the optimal production rule. For simplicity of analysis and exposition, we will assume also that S is a positive constant, T = ∞, and ρ > 0. These specifications make \(\dot{S} = 0,\) making the right hand side \(-\alpha \hat{I} -\rho (\hat{P} - S)\) a constant, a 1 = b 1 in (6.16), and a 2 = 0 in (6.17).
In view of its constant right-hand side, we can use Row (3) of Table A.2 to obtain its particular integral as
which is a constant and thus \(\dot{Q} = 0.\) From (6.14) and (6.15), we now have
The turnpike is defined by the triple \(\{\bar{I},\bar{P},\bar{\lambda }\}=\{ (\rho /\alpha ^{2})(\hat{P} - S) +\hat{ I},S,c(S -\hat{ P})\}\) formed from the turnpike expressions in (6.20), (6.21), and (6.22), respectively. Note that we could have obtained the turnpike levels directly by applying the conditions (3.108), which in this case are
If I 0 = Q, then the optimal solution stays on the turnpike. If I 0 ≠ Q, we must obtain the transient solution. It should be clear that the control in (6.25) may become negative, especially when the initial inventory is high. Let us complete the solution of the problem by considering three cases: I 0 ≤ Q, Q < I 0 ≤ Q − S∕m 1, and I 0 > Q − S∕m 1.
If I 0 ≤ Q, then the control in (6.25) with b 1 = I 0 − Q 0 is clearly positive. Thus, the optimal production rate is given by
Moreover, from the state in (6.25), we can obtain the corresponding I ∗(t) as
It is easy to see that I ∗(t) increases monotonically to Q as t → ∞, as shown in Fig. 6.4.
If Q < I 0 ≤ Q − S∕m 1, we can easily see from (6.40) that P ∗(0) ≥ 0. Furthermore, \(\dot{P}^{{\ast}}(t) \geq 0,\) and therefore the optimal production rate is once again given by (6.40). We also have I ∗(t) as in (6.41) and conclude that I ∗(t) → Q monotonically as t → ∞, as shown in Fig. 6.4.
Finally, if I 0 > Q − S∕m 1, (6.40) would have a negative value for the initial production which is infeasible. By (6.6), P ∗(0) = 0. We can now depict this situation in Fig. 6.4. The time \(\hat{t}\) shown in the figure is the time at which \(P^{{\ast}}(\hat{t}) =\hat{ P} +\lambda (\hat{t})/c = 0.\) We already know from (6.40) that in the case when I 0 = Q − S∕m 1, P ∗(0) = 0. This suggests that
For \(t \leq \hat{ t},\) we have P ∗(t) = 0 so that \(\dot{I}^{{\ast}} = -S,\) which gives
As for the adjoint equation (6.7), we now need the boundary condition at \(\hat{t}.\) For this, we can use (6.4) to obtain \(\lambda (\hat{t}) = -c\hat{P}.\) Thus, the adjoint equation in the interval \([0,\hat{t}\;]\) is
We can substitute I 0 − St for I in Eq. (6.44) and solve for λ. Note that we can easily obtain \(\hat{t}\) as
We can now specify the complete solution in the case when I 0 > Q − S∕m 1. With \(\hat{t}\) specified in (6.45), the solution is as follows.
For \(0 \leq t \leq \hat{ t}: P^{{\ast}}(t) = 0,I^{{\ast}}(t) = I_{0} - St,\) and λ(t) is the solution of
For \(t >\hat{ t}:\) we replace I 0 by Q − S∕m 1 and t by \(t -\hat{ t}\) on the right hand side of (6.40) to obtain \(P^{{\ast}}(t) = -Se^{m_{1}(t-\hat{t})}.\) The same replacements in (6.41) gives us the corresponding \(I^{{\ast}}(t) = -(S/m_{1})e^{m_{1}t}.\) Finally, λ(t) can be obtained by solving
We have thus solved the problem in every case of the initial condition I 0. These solutions are sketched in Fig. 6.4 for \(\hat{I} = 8,\hat{P} = 5,S = 6,h = 1,c = 4,\) and ρ = 0. 1, for three different values of I 0, namely, 25, 15, and 1. In Exercise 6.7, you are asked to solve the problem for these values and obtain Fig. 6.4.
6.2 The Wheat Trading Model
Consider a firm that buys and sells wheat. The firm’s only assets are cash and wheat, and the price of wheat over time is known with certainty. The objective of this firm is to buy and sell wheat in order to maximize the total value of its assets at the horizon time T. The problem here is similar to the simple cash balance model of Sect. 5.1 except that there are nonlinear holding costs associated with storing wheat. An extension of this model to one having two control variables appears in Ijiri and Thompson (1972) .
6.2.1 The Model
We introduce the following notation:
In this section we permit x and y to go negative, meaning that borrowing money and short-selling wheat are both allowed. In the next section we disallow the short-selling of wheat.
The state equations are:
and the control constraints are
where V 1 and V 2 are nonnegative constants. The objective function is:
subject to (6.46)–(6.48). Note that the problem is in the linear Mayer form.
6.2.2 Solution by the Maximum Principle
Introduce the adjoint variables λ 1 and λ 2 and define the Hamiltonian function
The adjoint equations are:
It is easy to solve (6.51) as
and (6.52) as
The interpretation of λ 1(t) is that it is the future value (at time T) of one dollar held as cash from t to T. The interpretation of λ 2(t) is the price at time T of a bushel of wheat less the total future value (at time T) of the stream of storage costs incurred to store that bushel of wheat from t to T.
From (6.50) the optimal control is
In Exercise 6.8 you are asked to provide the interpretation of this optimal policy.
Equations (6.46), (6.47), (6.54), and (6.55) determine the two-point boundary value problem which usually requires a numerical solution procedure. In the next section we assume a special form for the storage function h(y) to be able to obtain a closed-form solution.
6.2.3 Solution of a Special Case
For this special case we assume \(h(y) = \frac{1} {2}\vert y\vert,\;r = 0,\;x(0) = 10,\;y(0) = 0,\) V 1 = V 2 = 1, T = 6, and
We will apply the maximum principle (2.31) developed in Chap. 2 to this problem even though h(y) is not differentiable at y = 0. The answer can be obtained rigorously by using the maximum principle for models involving nondifferentiable functions discussed, e.g., in Clarke (1989, Chapter 4) and Feichtinger and Hartl (1985b) .
For this case with r = 0, we have λ 1(t) = 1 for all t from (6.53) so that the TPBVP is
For this simple problem it is easy to guess a solution. From the fact that λ 1 = 1, the optimal policy (6.55) reduces to
The graph of the price function is shown in Fig. 6.5. Since p(t) is increasing, short-selling is never optimal. Since the storage cost is 1/2 per unit per unit time and the wheat price jumps by 1 unit at t = 3, it never pays to store wheat for more than 2 time units. Because y(0) = 0, we have v ∗(t) = 0 for 0 ≤ t ≤ 1. This obviously must be a singular control. Suppose we start buying wheat at t ∗ > 1. From (6.60) the rate of buying is 1; clearly buying will continue at this rate until t = 3, and not longer. In order to not lose money on the storage of wheat, it must be sold within 2 time units of its purchase. Clearly we should start selling at t = 3+ at the maximum rate of 1, and continue until a last sale time t ∗∗. In order to sell exactly all of the wheat purchased, we must have
Thus, v ∗(t) = 0 in the interval [t ∗∗, 6], which is also a singular control. With this policy, y(t) > 0 for all t ∈ (t ∗, t ∗∗). From (6.59), \(\dot{\lambda }_{2} = 1/2\) in the interval (t ∗, t ∗∗). In order to have a singular control in the interval [t ∗∗, 6], we must have λ 2(t) = 4 in that interval. Also, in order to have a singular control in [0, t ∗], we must have λ 2(t) = 3 in that interval. Thus, λ 2(t ∗∗) −λ 2(t ∗) = 1, which with \(\dot{\lambda }_{2} = 1/2\) allows us to conclude that
and therefore t ∗ = 2 and t ∗∗ = 4. Thus from (6.59) and (6.60),
We can now sketch graphs for λ 2(t), v ∗(t), and y ∗(t) as shown in Fig. 6.6. In Exercise 6.13 you are asked to show that these trajectories are optimal by verifying that the maximum principle necessary conditions hold and that they are also sufficient.
6.2.4 The Wheat Trading Model with No Short-Selling
We next consider the wheat trading problem in the case when short-selling is not permitted, i.e., we impose the state constraint y ≥ 0. Moreover, for simplicity in exposition we consider the following special case of Norström (1978) . Specifically, we assume h(y) = y∕2, r = 0, x(0) = 10, y(0) = 1, V 1 = V 2 = 1, T = 3, and
The statement of the problem is:
To solve this problem, we use the Lagrangian form of the indirect maximum principle given in (4.29). The Hamiltonian is
The optimal control is
Whenever y = 0 we must impose \(\dot{y} = v \geq 0\) in order to insure that no short-selling occurs. Therefore,
Next we form the Lagrangian
where μ 1, μ 2, and η satisfy the complementary slackness conditions:
Furthermore, the optimal trajectory must satisfy
With r = 0, we get λ 1 = 1 as before, and
with
Let us first try γ = 0. Then λ 2(3−) = 4, and if we let \(\hat{t}\) denote the time of the last jump before the terminal time, then there is no jump in the interval \((\hat{t},3)\). Then, from (6.74) we have
and the optimal control from (6.67) or (6.68) is v ∗ = 1, i.e., buy wheat at the maximum rate of 1, so long as λ 2(t) > p(t). Also, this will give y(3) > 0, so that (6.75) holds. Let us next find the time \(\hat{t}\) of the last jump before the terminal time. Clearly, this value will not be larger than the time at which λ 2(t) = p(t). Thus,
Since p(t) is decreasing at the start of the problem, it appears that selling at the maximum rate of 1, i.e., v ∗ = −1, should be optimal at the start. Since the beginning inventory is y(0) = 1, selling at the rate of 1 can continue only until t = 1, at which time the inventory y(1) becomes 0. Suppose that we do nothing, i.e., v ∗(t) = 0 in the interval (1, 1. 8]. Then, t = 1 is an entry time (see Sect. 4.2) and t = 1. 8 is not an entry time, and \(\hat{t} = 1\). Hence, according to the maximum principle (4.29), λ 2(t) is continuous at t = 1. 8, and therefore λ 2(t) is given by (6.76) in the interval [1, 3), i.e.,
Using (6.73) with λ 1 = 1 in the interval (1, 1. 8] and v ∗ = 0 so that μ 1 = μ 2 = 0, we have
and consequently
Since h t = 0, the jump condition in (4.29) for the Hamiltonian at τ = 1 reduces to
From the definition of the Hamiltonian H in (6.66), we can rewrite the condition as
Since λ 1(t) = 1 for all t, the above condition reduces to
Substituting the values of p(1−) = p(1+) = 5 from (6.64), λ 2(1+) = 3 from (6.78), and v ∗(1+) = 0 and v ∗(1−) = −1 from the above discussion, we obtain
We can now use the jump condition in (4.29) on the adjoint variables to obtain
It is important to note that in the interval [1, 1. 8], the optimal control condition (6.68) holds, justifying our supposition that v ∗ = 0 in this interval. Furthermore, using (6.80) and (6.74),
and the optimal control condition (6.67) holds, justifying our supposition that v ∗ = −1 in this interval. Also, we can conclude that our guess γ = 0 is correct. The graphs of λ 2(t), p(t), and v ∗(t) are displayed in Fig. 6.7. To complete the solution of the problem, you are asked to determine the values of μ 1, μ 2, and η in these various intervals.
6.3 Decision Horizons and Forecast Horizons
In some dynamic problems it is possible to show that the optimal decisions during an initial positive time interval are either partially or wholly independent of the data from some future time onwards. In such cases, a forecast of the future data needs to be made only as far as that time to make optimal decisions in the initial time interval. The initial time interval is called the decision horizon and the time up to which data is required to make the optimal decisions during the decision horizon is called the forecast horizon; see Bes and Sethi (1988) , Bensoussan et al. (1983) , and Haurie and Sethi (1984) for details on these concepts. Whenever they exist, these horizons naturally decompose the problem into a series of smaller problems.
If the optimal decisions during the decision horizon are completely independent of the data beyond the forecast horizon, then the latter is called a strong forecast horizon . If, on the other hand, some mild restrictions on the data after the forecast horizon are required in order to keep the optimal decisions during the decision horizon unaffected, then it is called a weak forecast horizon .
In this section we demonstrate these concepts in the context of the wheat trading model of the previous section. In Sect. 6.3.1 we obtain a decision horizon for the model of Sect. 6.2.4 which is also a weak forecast horizon. In Sect. 6.3.2 we modify the wheat trading model by adding a warehousing constraint. For the new problem we obtain a decision horizon and a strong forecast horizon. See also Sethi and Thompson (1982) , Rempala (1986) and Hartl (1986a, 1988a) for further research in the context of the wheat trading model.
In what follows we obtain these horizons and verify them for some examples with different forecast data. For more details and proofs in other situations including more general ones, see Modigliani and Hohn (1955) , Lieber (1973) , Pekelman (1974, 1975, 1979) , Kleindorfer and Lieber (1979) , Vanthienen (1975) , Morton (1978) , Lundin and Morton (1975) , Rempala and Sethi (1988, 1992) , Hartl (1989a) , and Sethi (1990) .
6.3.1 Horizons for the Wheat Trading Model with No Short-Selling
For the model of Sect. 6.2.4, we will demonstrate that t = 1 is a decision horizon as well as a weak forecast horizon. In Fig. 6.8 we have redrawn Fig. 6.7 with a new price trajectory in the time interval [1, 3]. Also in the figure, we have extended the initial λ 2 trajectory and labeled it the price shield . Its significance is that, as long as the new price trajectory in the interval [1, 3] stays below the price shield, the optimal solution in the interval [0, 1], which is the decision horizon, remains unchanged. That is, it is optimal to sell throughout the interval. The restriction that p(t) must stay below the price shield in [1, 3] is the reason that t = 1 is a weak forecast horizon. The optimality of the control shown in Fig. 6.8 can be concluded by obtaining the adjoint trajectory in the interval [1, 3] as a straight line with slope 1∕2 and the terminal value λ 2(3−) = p(3). This way of drawing the adjoint trajectory is correct as long as the corresponding policy does not violate the inventory constraint y(t) ≥ 0 in the interval [1, 3]. For example, this will be the case if the buy interval in Fig. 6.8 is shorter than the sell interval at the end. On the other hand, if the inventory constraint is violated, then the λ 2(t) trajectory may jump in the interval [1, 3), and it will be more complicated to obtain it. Nevertheless, the decision horizon and weak forecast horizon still occur at t = 1. Moreover, if we let T > 1 be any finite horizon and assume that p(t) in the interval [1, T] is always below the price shield line of Fig. 6.8 extended to T, then the policy of selling at the maximum rate in the interval [0, 1] remains optimal.
6.3.2 Horizons for the Wheat Trading Model with No Short-Selling and a Warehousing Constraint
In order to give an example in which a strong forecast horizon occurs, we modify the example of Sect. 6.2.4 by adding the warehousing constraint y ≤ 1 or
changing the terminal time to T = 4, and defining the price trajectory to be
The Hamiltonian of the new problem is unchanged and is given in (6.66). Furthermore, λ 1 = 1. The optimal control is defined in three parts as:
Defining a Lagrange multiplier η 1 for the derivative of (6.82), i.e., for \(-\dot{y} = -v \geq 0\), we form the Lagrangian
where μ 1, μ 2, and η satisfy (6.70)–(6.72) and η 1 satisfies
Furthermore, the optimal trajectory must satisfy
As before, λ 1 = 1 and λ 2 satisfies
where
Let us first try γ 1 = γ 2 = 0. Let \(\hat{t}\) be the time of the last jump of the adjoint function λ 2(t) before the terminal time T = 4. Then,
The graph of (6.92) intersects the price trajectory at t = 8∕5 as shown in Fig. 6.9. It also stays above the price trajectory in the interval [8∕5, 4] so that, if there were no warehousing constraint (6.82), the optimal decision in this interval would be to buy at the maximum rate. However, with the constraint (6.82), this is not possible. Thus \(\hat{t} > 8/5\), since λ 2 will have a jump in the interval [8∕5, 4].
To find the actual value of \(\hat{t}\) we must insert a line of slope 1∕2 above the minimum price at t = 2 in such a way that its two intersection points with the price trajectory are exactly one time unit (the time required to fill up the warehouse) apart. Thus using (6.83), \(\hat{t}\) must satisfy
which yields \(\hat{t} = 17/6\).
The rest of the analysis for determining λ 2 including the jump conditions is similar to that given in Sect. 6.2.4. Thus,
This makes γ 1 = γ 2 = 0 the correct guess.
Given (6.93), the optimal policy is given by (6.84)–(6.86) and is shown in Fig. 6.9. To complete the maximum principle we must derive expressions for the Lagrange multipliers in the four intervals shown in Fig. 6.9.
Interval [0, 1): μ 2 = η = η 1 = 0, μ 1 = p −λ 2 > 0;
Interval [1, 11∕6): μ 1 = μ 2 = η 1 = 0, η = p −λ 2 > 0, \(\dot{\eta }\leq 0\);
Interval [11∕16, 17∕6): μ 1 = η = η 1 = 0, μ 2 = λ 2 − p > 0;
Interval [17∕6, 4]: μ 1 = μ 2 = η = 0, η 1 = λ 2 − p > 0, \(\dot{\eta }_{1} \leq 0\), γ 1 = γ 2 = 0;
In Exercise 6.17 you are asked to solve another variant of this problem.
For the example in Fig. 6.9 we have labeled t = 1 as a decision horizon and \(\hat{t} = 17/6\) as a strong forecast horizon. By this we mean that the optimal decision in [0, 1] continues to be to sell at the maximum rate regardless of the price trajectory p(t) for t > 17∕6. Because \(\hat{t} = 17/6\) is a strong forecast horizon, we can terminate the price shield at that time as shown in the figure.
In order to illustrate the statements in the previous paragraph, we consider two examples of price changes after \(\hat{t} = 17/6.\)
Example 6.3
Assume the price trajectory to be
which is sketched in Fig. 6.10. Note that the price trajectory up to time 17∕6 is the same as before, and the price after time 17∕6 goes above the extension of the price shield in Fig. 6.9.
Solution The new λ 2 trajectory is shown in Fig. 6.10, which is the same as before for t < 17∕6, and after that it is λ 2(t) = t∕2 + 6 for t ∈ [17∕6, 4]. The optimal policy is as shown in Fig. 6.10, and as previously asserted, the optimal policy in [0,1) remains unchanged. In Exercise 6.17 you are asked to verify the maximum principle for the solution of Fig. 6.10.
Example 6.4
Assume the price trajectory to be
which is sketched in Fig. 6.11.
Solution Again the price trajectory is the same up to time 17∕6, but the price after time 17∕6 is declining. This changes the optimal policy in the time interval [1, 17∕6), but the optimal policy will still be to sell in [0, 1).
As in the beginning of the section, we solve (6.90) to obtain λ 2(t) = t∕2 + 5∕4 for \(\hat{t}_{1} \leq t \leq 4,\) where \(\hat{t}_{1} \geq 1\) is the time of the last jump which is to be determined. It is intuitively clear that some profit can be made by buying and selling to take advantage of the price rise between t = 2 and t = 17∕6. For this, the λ 2(t) trajectory must cross the price trajectory between times 2 and 17∕6 as shown in Fig. 6.11, and the inventory y must go to 0 between times 17∕6 and 4 so that λ 2 can jump downward to satisfy the ending condition λ 2(4−) = p(4) = 13∕4. Since we must buy and sell equal amounts, the point of intersection of the λ 2 trajectory with the rising price segment, i.e., \(\hat{t}_{1}-\alpha\), must be exactly in the middle of the two other intersection points, \(\hat{t}_{1}\) and \(\hat{t}_{1} - 2\alpha\), of λ 2 with the two declining price trajectories. Thus, \(\hat{t}_{1}\) and α must satisfy:
These can be solved to yield \(\hat{t}_{1} = 163/54\) and α = 5∕9. The times \(\hat{t}_{1},\hat{t}_{1}-\alpha,\) and \(\hat{t}_{1} - 2\alpha\) are shown in Fig. 6.11. The λ 2 trajectory is given by
Evaluation of the Lagrange multipliers and verification of the maximum principle is similar to that for the case in Fig. 6.9.
In Sect. 6.3 we have given several examples of decision horizons and weak and strong forecast horizons. In Sect. 6.3.1 we found a decision horizon which was also a weak forecast horizon, and it occurred exactly when y(t) = 0. We also introduced the idea of a price shield in that section. In Sect. 6.3.2 we imposed a warehousing constraint and obtained the same decision horizon and a strong forecast horizon, which occurred when y(t) = 1.
Note that if we had solved the problem with T = 1, then y ∗(1) = 0; and if we had solved the problem with T = 17∕6, then y ∗(1) = 0 and y ∗(17∕6) = 1. The latter problem has the smallest T such that both y ∗ = 0 and y ∗ = 1 occur for t > 0, given the price trajectory. This is one of the ways that time t = 17∕6 can be found to be a forecast horizon along with the decision horizon at time t = 1. There are other ways to find strong forecast horizons. For a survey of the literature, see Chand et al. (2002) .
Exercises for Chapter 6
E 6.1
Verify the expressions for a 1 and a 2 given in (6.16) and (6.17).
E 6.2
Verify (6.27). Note that ρ = 0 is assumed in Sect. 6.1.4.
E 6.3
Verify (6.29). Again assume ρ = 0.
E 6.4
Given the demand function
\(\rho = 0,\hat{I} = 15,T = 16,\mbox{ and }\alpha = 1,\) obtain Q(t) from (6.27).
E 6.5
Complete the solution of Example 6.2 in Sect. 6.1.4.
E 6.6
For the model of Sect. 6.1.6, derive the turnpike triple by using the conditions in (6.39).
E 6.7
Solve the production-inventory model of Sect. 6.1.6 for the parameter values listed on Fig. 6.4, and draw the figure using MATLAB or another suitable software.
E 6.8
Give an intuitive interpretation of (6.55).
E 6.9
Assume that there is a transaction cost cv 2 when v units of wheat are bought or sold in the model of Sect. 6.2.1. Derive the form of the optimal policy.
E 6.10
In Exercise 6.9, assume T = 10, x(0) = 10, y(0) = 0, c = 1∕18, h(y) = (1∕2)y 2, V 1 = V 2 = ∞, r = 0, and p(t) = 10 + t. Solve the resulting TPBVP to obtain the optimal control in closed form.
E 6.11
Set up the two-point boundary value problem for Exercise 6.9 with c = 0. 05, h(y) = (1∕2)y 2, and the remaining values of parameters as in the model of Sect. 6.2.3.
E 6.12
Use Excel, as illustrated in Sect. 2.5, to solve the TPBVP of Exercise 6.11.
E 6.13
Show that the solution obtained for the problem in Sect. 6.2.3 satisfies the necessary conditions of the maximum principle. Conclude the optimality of the solution by showing that the maximum principle conditions are also sufficient.
E 6.14
Re-solve the problem of Sect. 6.2.3 with V 1 = 2 and V 2 = 1.
E 6.15
Compute the optimal trajectories for μ 1, μ 2, and η for the model in Sect. 6.2.4.
E 6.16
Solve the model in Sect. 6.2.4 with each of the following conditions:
E 6.17
Verify that the solutions shown in Figs. 6.10 and 6.11 satisfy the maximum principle.
E 6.18
Re-solve the model of Sect. 6.3.2 with y(0) = 1∕2 and with the warehousing constraint y ≤ 1∕2 in place of (6.82).
E 6.19
Solve and interpret the following production planning problem with linear inventory holding costs:
E 6.20
Re-solve Exercise 6.19 with the state equation \(\dot{I}(t) = P(t) - S(t),\) where I(0) = I 0 ≥ 0 and I(T) is not fixed. Assume the demand S(t) to be continuous in t and non-negative. Keep the state constraint I ≥ 0, but drop the production constraint P ≥ 0 for simplicity. For specificity, you may assume S = −sinπt + C with the constant C ≥ 1 and T = 4. (Note that negative production can and will occur when initial inventory I 0 is too large. Specifically, how large is too large depends on the parameters of the problem.)
E 6.21
Re-solve Exercise 6.19 with the state equation \(\dot{I}(t) = P(t) - S,\) where S > 0 and h > 0 are constants, I(0) = I 0 > cS 2∕2h, and I(T) is not fixed. Assume that T is sufficiently large. Also, graph the optimal P ∗(t) and I ∗(t), t ∈ [0, T].
Bibliography
Bensoussan A , Crouhy M , Proth J-M (1983) Mathematical theory of production planning. North-Holland, Amsterdam
Bes C, Sethi SP (1988) Concepts of forecast and decision horizons: applications to dynamic stochastic optimization problems. Math Oper Res 13(2):295–310
Brown RG (1959) Statistical forecasting for inventory control. McGraw-Hill Book, New York
Brown RG (1963) Smoothing, forecasting and prediction. Prentice-Hall, Englewood Cliffs
Chand S , Hsu VN , Sethi SP (2002) Forecast, solution and rolling horizons in operations management problems: a classified bibliography. Manufact Service Oper Manag 4(1):25–43
Clarke FH (1989) Methods of dynamic and nonsmooth optimization. Society for Industrial and Applied Mathematics, Philadelphia
Feichtinger G, Hartl RF (1985b) On the use of Hamiltonian and maximized Hamiltonian in non-differentiable control theory. J Optim Theory Appl 46:493–504
Harris FW (1913) How many parts to make at once. Factory Mag Manag 10:135–136, 152
Hartl RF (1986a) A forward algorithm for a generalized wheat trading model. Z Oper Res 30:A 135–A 144
Hartl RF (1988a) A wheat trading model with demand and spoilage. In: Feichtinger G (ed) Optimal control theory and economic analysis, vol 3. North-Holland, Amsterdam, pp 235–244
Hartl RF (1989a) On forward algorithms for a generalized wheat trading model. In: Chikan A (ed) Progress in inventory research (proceedings of 4th international symposium on inventories). Hungarian Academy of Science, Budapest
Haurie A, Sethi SP (1984) Decision and forecast horizons, agreeable plans, and the maximum principle for infinite horizon control problems. Oper Res Lett 3(5):261–265
Holt CC , Modigliani F , Muth JF, Simon HA (1960) Planning production, inventories and workforce. Prentice-Hall, Englewood Cliffs
Ijiri Y, Thompson GL (1970) Applications of mathematical control theory to accounting and budgeting (the continuous wheat trading model). Account Rev 45:246–258
Ijiri Y, Thompson GL (1972) Mathematical control theory solution of an interactive accounting flows model. Naval Res Logist Quart 19:411–422
Kleindorfer PR, Lieber Z (1979) Algorithms and planning horizon results for production planning problems with separable costs. Oper Res 27:874–887
Lieber Z (1973) An extension of Modigliani and Hohn’s planning horizon results. Manag Sci 20:319–330
Lundin RA, Morton TE (1975) Planning horizons for the dynamic lot size model: protective procedures and computational results. Oper Res 23:711–734
Modigliani F, Hohn F (1955) Production planning over time. Econometrica 23:46–66
Morton TE (1978) Universal planning horizons for generalized convex production scheduling. Oper Res 26:1046–1057
Norström CJ (1978) The continuous wheat trading model reconsidered. An application of mathematical control theory with a state constraint, W.P. 58–77-78, GSIA, Carnegie Mellon University, Pittsburgh
Pekelman D (1974) Simultaneous price-production decision. Oper Res 22:788–794
Pekelman D (1975) Production smoothing with fluctuating price. Manag Sci 21:576–590
Pekelman D (1979) On optimal utilization of production processes. Oper Res 27:260–278
Rempala R (1986) Horizon for the dynamic family of wheat trading problems. In: Proceedings fourth international symposium on inventories, Budapest
Rempala R, Sethi SP (1988) Forecast horizons in single product inventory models. In: Feichtinger G (ed) Optimal control theory and economic analysis, vol 3. North-Holland, Amsterdam, pp 225–233
Rempala R, Sethi SP (1992) Decision and forecast horizons for one-dimensional optimal control problems: existence results and applications. Optimal Control Appl Methods 13:179–192
Sethi SP (1978a) A survey of management science applications of the deterministic maximum principle. TIMS Stud Manag Sci 9:33–67
Sethi SP (1984) Application of the maximum principle to production and inventory problems. In: Proceedings third international symposium on inventories, Budapest, pp 753–756
Sethi SP (1990) Decision and forecast horizons in dynamic optimization. In: Singh MG (ed) Systems and control encyclopedia supplementary, vol 1. Pergamon Press, Oxford, pp 192–198
Sethi SP, Thompson GL (1982) Planning and forecast horizons in a simple wheat trading model. In: Feichtinger G, Kall P (eds) Operations research in progress. D. Reidel Publishing Company, Dordrecht, pp 203–214
Thompson GL, Sethi SP (1980) Turnpike horizons for production planning. Manag Sci 26:229–241
Vanthienen L (1975) A simultaneous price-reduction decision making with production adjustment costs. In: Proceedings XX international meeting of TIMS held in Tel Aviv, Israel on 24–29 June 1973, vol 1. Jerusalem Academic Press, Jerusalem, pp 249–254
Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Manag Sci 5:89–96
Zwillinger D (2003) Standard mathematical tables and formulae. Chapman & Hall/CRC, Boca Raton
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sethi, S.P. (2019). Applications to Production and Inventory. In: Optimal Control Theory. Springer, Cham. https://doi.org/10.1007/978-3-319-98237-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-98237-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98236-6
Online ISBN: 978-3-319-98237-3
eBook Packages: Business and ManagementBusiness and Management (R0)