*Article* **Robust Optimization Model with Shared Uncertain Parameters in Multi-Stage Logistics Production and Inventory Process**

#### **Lijun Xu 1, Yijia Zhou 2,\* and Bo Yu <sup>3</sup>**


Received: 24 December 2019; Accepted: 2 February 2020 ; Published: 7 February 2020

**Abstract:** In this paper, we focus on a class of robust optimization problems whose objectives and constraints share the same uncertain parameters. The existing approaches separately address the worst cases of each objective and each constraint, and then reformulate the model by their respective dual forms in their worst cases. These approaches may result in that the value of uncertain parameters in the optimal solution may not be the same one as in the worst case of each constraint, since it is highly improbable to reach their worst cases simultaneously. In terms of being too conservative for this kind of robust model, we propose a new robust optimization model with shared uncertain parameters involving only the worst case of objectives. The proposed model is evaluated for the multi-stage logistics production and inventory process problem. The numerical experiment shows that the proposed robust optimization model can give a valid and reasonable decision in practice.

**Keywords:** robust optimization; duality theory; uncertain set; logistics production; inventory process

#### **1. Introduction**

In real life, we usually encounter some problems with uncertain data. In order to solve those problems properly, we must consider them within an uncertain scope. For problems with uncertainty, there are many approaches to handle them, such as sensitivity analysis, stochastic programming, and robust optimization. In this paper, we focus on one of the popular methodologies, robust optimization (RO), which addresses optimization problems with uncertain parameters described using uncertainty sets other than probability distributions. The aim of robust optimization is to determine a solution that is feasible for any realizations of uncertain parameters, and to be optimal for the worst-case scenario of these uncertain parameters. In other words, robust optimization gives a decision which is ensured to be "good" for all possible realizations of uncertain parameters.

#### *1.1. Review of Robust Optimization*

In recent decades, robust optimization has been popularized to handle practical problems with incomplete messages, namely, with uncertain data. The primary work by Bertsimas et al. [1] surveys research on robust optimization both theoretically and practically. For linear optimization problems, Brown et al. [2] propose a special robust optimization with constructed uncertainty sets. Ben-Tal et al. [3] relax the standard robustness by varying the protection level across the uncertainty set and extend the framework of robust optimization. There are also some works on robust optimization for the mixed integer stochastic optimization problem. For example, Bertsimas et al. [4] show that there can be a good approximation of the static robust solution for two-stage mixed integer stochastic problem under fairly general assumptions. Delage et al. [5] demonstrate that the associated distributionally

robust stochastic programming with a large range of objective functions can be solved efficiently by the proposed model with uncertainty in the form of distribution and moments. Luo et al. [6] investigate robust optimization equilibria in game theory with two players by estimating a bounded asymmetric uncertain set. Xu et al. consider linear regression problems with least-square error in [7]. Later, Xu et al. [8] connect robust optimization and distributionally robust stochastic programming and show that the solution of the RO problem is also a solution of the latter problem. Distributionally robust optimization is later studied as one popular area of robust optimization including convergence, algorithms, and applications, see [9–13] for examples.

In most of those robust optimization models mentioned above, the same uncertain variable does not exist in either objective or constraints simultaneously. However, in some papers like [14–17], the objective and constraints often contain the same uncertain variable simultaneously. In other words, they share the same uncertain parameters. In this case, researchers usually consider the worst cases over the uncertain variable of the objective and each constraint, respectively. For instance, Tong et al. [17] respectively get the dual forms of the worst objective and the worst constraints under the given uncertainty sets. Recently, Yao [18] also employs this method in the robust multi-stage logistics production and inventory process problem. The resulting optimization of this approach is usually a convex and linear problem that is easy to solve. However, these robust models are overly conservative, since the worst case of each objective and each constraint are handled separately. Therefore, they may result in a highly impossible case—that the same uncertain variable is solved with different values in objective and constraints.

#### *1.2. Motivation*

Most robust optimization models involve minmax(maxmin) objective functions. The popular approach to handle this kinds of objective is reformulating minmax(maxmin) problems to min(max) ones by the dual theorem. For example, the theoretical work in [11] reformulates the inner maximization as a semi-infinite programming through Lagrange dual when solving minimax distributionally robust optimization problems. Another practical work [10] for economic dispatch in energy integrated systems also convert objective with respect to uncertainty to its dual form. Similarly, for max(min) problems (i.e., the worst cases) in constraints, one strategy is to consider its dual forms with respect to uncertain parameters. Like the work in [17,18] separably transforms the worst-case objective and each constraint to the corresponding dual forms under the given uncertainty sets. However, the separable and respective way to convert the worst-case objective and constraints most likely results in the difference value of the uncertain parameter being between the optimal objective and the worst-case constraint. Recently, Zhou et al. [19] propose robust risk–reward optimization models which ensure the same distribution both in the reward and in constraints. Motivated by the above works, we are prompted to focus on a generalized work which only considers the worst case of the objective itself over the shared uncertain variable instead of also considering the worst case of each constraint. We present an innovative model different to the existing robust optimization models which are overly conservative. In this way, the optimal value of the uncertain parameter in proposed model can be the same one in both the objective and constraints. Moreover, it is less conservative naturally and reasonable in practice.

#### *1.3. Orgnization*

In Section 2, we propose the standard form of the robust optimization model with shared uncertain parameters and compare it with the existing robust model. We will show that the proposed robust optimization model is more reasonable. In Section 3, we utilize the approach to remodel a real robust problem in logistics production and inventory process. Then we reformulate them to tractable forms by dual theory under some assumptions. Numerical experiment conducted in Section 4 shows that the existing robust model is too conservative to have a solution in some cases, but the new robust model is validated to forecast earnings and give a good decision to investors. Finally, we conclude this paper in the last section.

#### **2. Robust Optimization Model with Shared Uncertain Parameters**

The optimization problems with uncertainty are generally formulated as follows:

$$\begin{array}{ll}\min\_{\mathbf{x}} & f(\mathbf{x}, \mathbf{\upxi}) \\ \text{s.t.} & g\_i(\mathbf{x}, \mathbf{\upxi}) \ge 0, \ i = 1, \dots, k, \\ & \mathbf{x} \in \mathcal{X}, \end{array} \tag{1}$$

where both the objective and constraints are uncertain with the same random variable *ξ* and the feasible set <sup>X</sup> <sup>⊆</sup> <sup>R</sup>*n*. We assume that the variable *<sup>ξ</sup>* belongs to a compact uncertainty set *<sup>U</sup>*. Generally, the model in Equation (1) is hard to solve because of the existence of uncertain parameter. The popular way to handle this problem, like in [14,16,18,20,21], is to consider the worst case of objective and each constraint, respectively. That is,

$$\begin{array}{ll}\min\limits\_{\mathbf{x}} & \max\limits\_{\substack{\boldsymbol{\xi}\in\mathcal{U}\\ \boldsymbol{\xi}\in\mathcal{U}}} f(\mathbf{x},\boldsymbol{\xi})\\ \text{s.t.} & \min\limits\_{\substack{\boldsymbol{\xi}\in\mathcal{U}\\ \boldsymbol{\xi}\in\mathcal{U}}} g\_{i}(\mathbf{x},\boldsymbol{\xi}) \ge 0, \ i = 1,\cdots,k,\\ & \mathbf{x}\in\mathcal{X}.\end{array}\tag{2}$$

This model is regarded as the classic robust optimization problem.

#### *2.1. Goal and Method*

The robust optimization model in Equation (2) considers the worst cases of the objective and all constraints with *ξ*, respectively. It is straightforward that the uncertain variable *ξ* in the respective worst case of the objective and constraints are allowed to be different. This may be an overly conservative assumption since it requires that each constraint should be satisfied for all possible (in particular, the worst case) realizations of the uncertain parameters *ξ*. Therefore, it makes sense to improve these kinds of models, in fact, that one variable should have the same meaning and evaluation at the same scenario. An interesting alternative would be to consider a model in which the optimal uncertain variable in the worst case of the objective itself meets related constraints in Equation (1). Motivated by this consideration, we present the following robust optimization model with shared uncertain parameters (denote as RO\_Shared):

$$\begin{array}{ll}\min\_{\mathbf{x}} & \left\{ \max\_{\substack{\mathbf{y}\in U}} f(\mathbf{x}, \mathbf{\upxi}) : g\_i(\mathbf{x}, \mathbf{\upxi}) \ge \mathbf{0}, \ i = 1, \dots, k \right\} \\ \text{s.t.} & \mathbf{x} \in \mathcal{X}\_1. \end{array} \tag{3}$$

where the feasible set X<sup>1</sup> = {*x* ∈ X : *gi*(*x*, *ξ*) ≥ 0, *ξ* ∈ *U*, *i* = 1, ··· , *k*}. We can easily obtain that model in Equation (3) as it only focuses on the worst case of the objective over *ξ* which indeed satisfies all constraints simultaneously. This model meets the requirement of the real situation more suitably than the model in Equation (2). We illustrate this point by the following example.

#### *2.2. Synthetic Examples and Analysis*

**Example 1.** *Compare the following two robust optimization problems:*

$$\begin{array}{ll}\underset{\mathbf{x}\in\mathcal{X}}{\min} & \max\limits\_{\substack{\mathbf{\tilde{x}}\in\mathcal{U} \\ \mathbf{s}\in\mathcal{U}}} \mathbf{3}\mathbf{x} - \mathbf{\tilde{s}} \\ \text{s.t.} & \min\limits\_{\substack{\mathbf{\tilde{x}}\in\mathcal{U} \\ \mathbf{s}\in\mathcal{U}}} g(\mathbf{x}, \mathbf{\tilde{y}}) = \mathbf{x} - \mathbf{\tilde{y}}^{2} \geq 0. \end{array} \tag{4}$$

$$\min\_{\mathbf{x}\in\mathcal{R}}\left\{\begin{array}{ll}\max\_{\boldsymbol{\xi}\in\boldsymbol{I}} & \mathbf{3}\mathbf{x}-\boldsymbol{\xi}^{\mathsf{T}}\\ \text{s.t.} & \mathbf{g}(\mathbf{x},\boldsymbol{\xi})=\mathbf{x}-\boldsymbol{\xi}^{\mathsf{T}}\geq\mathbf{0} \end{array}\right\}.\tag{5}$$

*Let* X = [1, 5] *and U* = [0, 2]*. We obtain the optimal solution x* = 4 *and ξ*<sup>1</sup> = 0 *in Equation (4), but the constraint reaches its worst case at ξ*<sup>2</sup> = 2*. So Equation (4) is overly conservative since the value of ξ in the optimal solution may not be the same one as in the worst case of the constraint. If we also consider the worst case of the constraint, we may get different situations which would not likely to happen simultaneously in practice. Meanwhile, the optimal solution of Equation (5) is* (*x*, *ξ*)=(1, 0) *which ensures intrinsic consistences of ξ in objective and constraints. Clearly, Equation (5) is less conservative than Equation (4) in terms of optimal objective value.*

In fact, the model in Equation (2) is a conservative approximation for the new model in Equation (3). We conclude that the model in Equation (2) is feasible ⇒ the model in Equation (3) is feasible.

Denote the non-empty set

$$\mathcal{X}\_2^\circ = \left\{ \mathbf{x} \in \mathcal{X} : \min\_{\xi \in \mathcal{U}} g\_i(\mathbf{x}, \xi) \ge 0, \ i = 1, \dots, k \right\}$$

as the feasible set of model in Equation (2). According to the definition of the feasible set, for any *x*<sup>∗</sup> ∈ X2, we have min*<sup>ξ</sup>*∈*<sup>U</sup> gi*(*x*∗, *ξ*) ≥ 0, *i* = 1, ..., *n*. Obviously, we obtain that *gi*(*x*∗, *ξ*) ≥ 0, *i* = 1, ..., *n* are satisfied for all *ξ* ∈ *U*. Thus *x*<sup>∗</sup> is the feasible solution of the model in Equation (3).

The above discussion gives rise to the following elementary result.

**Theorem 1.** *The feasible set* X<sup>2</sup> *constitutes a conservative approximation for* X1*, that is,* X<sup>2</sup> ⊆ X1*.*

Conversely, if the model in Equation (3) is feasible, the model in Equation (2) is not always feasible, as demonstrated in the following example.

**Example 2.** *Consider the robust optimization problems in Example 1 with* X = [1, 2] *and U* = [0, 2]*. And then the model in Equation (5) is always feasible for* ∀*x* ∈ X *. Meanwhile, for any x* ∈ X , *x* − 4 = min*ξ*∈*<sup>U</sup> g*(*x*, *ξ*) ≥ 0 *does not hold, hence the model in Equation (2) is infeasible.*

#### *2.3. Real Example in Portfolio Optimization*

Now we take for example the practical portfolio problem. The current robust reward–risk model (see [14–17] for example) is presented as follows:

$$\begin{array}{ll}\underset{\boldsymbol{\pi}\in\mathcal{H}^{\*}}{\min} & \max\_{\boldsymbol{p}\in\beta^{\mathsf{p}}} \text{CVaR}\_{\boldsymbol{p}}(\boldsymbol{x})\\ \text{s.t.} & \min\_{\boldsymbol{p}\in\beta^{\mathsf{p}}} \mathbb{E}\_{\boldsymbol{p}}(\boldsymbol{x}) \geq \mathcal{S}\_{\boldsymbol{\star}\boldsymbol{\prime}} \end{array} \tag{6}$$

where *x* ∈ X is the decision variable, *p* ∈ P is an uncertainty set, and *S*<sup>∗</sup> represents the lowest expected return. Obviously, Equation (6) is a specific example of Equation (2) by separately considering the worst-case distribution in the reward <sup>E</sup>*<sup>p</sup>* and the risk CVaR*p*. Intuitively, argmax*p*∈<sup>P</sup> CVaR*p*(*x*) may most likely be different from argmin*p*∈<sup>P</sup> <sup>E</sup>*p*(*x*).

However, the corresponding RO\_Shared model in Equation (3) for the robust reward–risk model is

$$\min\_{\mathbf{x}\in\mathcal{X}}\max\_{\boldsymbol{\mu}\in\mathcal{\boldsymbol{\beta}}}\{\text{CVaR}\_{\boldsymbol{\mu}}(\boldsymbol{x}):\mathbb{E}\_{\boldsymbol{\mathcal{P}}}(\boldsymbol{x})\geq\mathcal{S}\_{\boldsymbol{\ast}}\}.\tag{7}$$

It is straightforward to see the difference on the value of *p* in the optimal solution of the models in Equations (6) and (7).

It should be clear that the models in Equations (3) and (7) are more flexible than the models in Equations (2) and (6), i.e., it has a larger robust feasible set, enabling a better optimal value while still satisfying all possible realizations of the constraints.

The proposed model in Equation (3) is a generalized model, so we can only provide a framework on how to solve it. That is, the inner maximization problem in Equation (3) can be equivalent to its dual form which is a minimization problem under some assumptions and then the minmax model in Equation (3) can be converted to a minimization problem. Like the specific problems considered in [14–23], we focus on affinely adjustable robust optimization with application to a multi-stage logistics production and inventory process problem.

#### **3. Multi-Stage Logistics Production and Inventory Process**

For multi-stage (affinely adjustable) robust optimization such as models in [22,23] and so on, the worst cases of both objective and constraints are also considered and converted to their dual forms, respectively. In this way, they may get different optimal values of the same uncertain variable, which is not true in fact. In this section, we remodel the affinely adjustable robust logistics and inventory problem as the new robust optimization in Equation (3).

#### *3.1. Problem Description*

First, we present the following notations.


For this problem, the aim is to maximum reward and the deterministic optimization model presented in [18] is as follows:

$$\begin{array}{ll}\displaystyle\max & \sum\_{i \in I} \sum\_{I \in \mathcal{T}} p\_i^t d\_i^t - \sum\_{i \in I} \sum\_{I \in \mathcal{K}} c\_i^t x\_i^t - \sum\_{i \in I} \sum\_{I \in \mathcal{K}} m\_i^t v\_i^t\\ \text{s.t.} & v\_i^{t+1} \le v\_i^t + x\_i^t - d\_i^t, \forall i \in I, t \in \{1, \dots, T-1\},\\ & 0 \le x\_i^t \le P\_i^t, \forall i \in I, t \in \mathfrak{T},\\ & 0 \le \sum\_{I \in \mathfrak{T}} x\_i^t \le Q\_i, \forall i \in I, t \in \mathfrak{T},\\ & v\_i^t \ge 0, \forall i \in I, t \in \mathfrak{T},\\ & \sum\_{i \in I} x\_i^t \le C, \forall i \in \mathfrak{T},\\ & v\_i^t = 0, \forall i \in I.\end{array} \tag{8}$$

Now we consider robust counterpart in terms of uncertain demand *d<sup>t</sup> <sup>i</sup>* like in [22]. That is, it is assumed that demand *d<sup>t</sup> <sup>i</sup>* is unknown and belongs to a prescribed polyhedral uncertainty set:

$$d\_i^t \in \mathcal{U} = \{ d\_i^t : (1 - \theta)d\_i^t \le d\_i^t \le (1 + \theta)d\_{i'}^t \sum\_{t \in \mathbb{Z}} d\_i^t \le D\_{i'} \,\forall i \in I, t \in \mathfrak{T} \},$$

where *θ* is uncertainty level, ˆ*d<sup>t</sup> <sup>i</sup>* is nominal demand in asset *i* during time interval *t* and *Di* is an upper bound for demand in asset *i*. The adjustable control variables *x<sup>t</sup> <sup>i</sup>* and state variables *<sup>v</sup><sup>t</sup> <sup>i</sup>* can be represented as the following affine functions of the previously observed demand, i.e.,

$$\begin{aligned} \boldsymbol{x}\_{i}^{t} &= \boldsymbol{\eta}\_{it}^{'} + \sum\_{s \in I} \sum\_{\tau \in I\_{t}} \boldsymbol{\eta}\_{it}^{s\tau} \boldsymbol{d}\_{s}^{\tau}, \\ \boldsymbol{\upsilon}\_{i}^{t} &= \boldsymbol{\pi}\_{it}^{'} + \sum\_{s \in I} \sum\_{\tau \in I\_{t}} \boldsymbol{\pi}\_{it}^{s\tau} \boldsymbol{d}\_{s}^{\tau}, \end{aligned}$$

where *η it*, *<sup>η</sup>s<sup>τ</sup> it* , *<sup>π</sup> it* and *<sup>π</sup>s<sup>τ</sup> it* are non-adjustable variables and *It* = {0, 1, ··· , *t* − 1}.

#### *3.2. The Proposed Model for this Problem*

By substituting the state and control variables, we obtain the new affinely adjustable robust counterpart of model in Equation (8) with the shared uncertain *d<sup>t</sup> <sup>i</sup>* as follows:

max *η*,*η* ,*π*,*π* ⎧ ⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎨ ⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎩ min *<sup>d</sup>*∈*<sup>U</sup>* <sup>∑</sup> *i*∈*I* ∑ *t*∈T *pt i dt <sup>i</sup>* − ∑ *i*∈*I* ∑ *t*∈T *ct i* (*η it* + ∑ *s*∈*I* ∑ *τ*∈*It ηs<sup>τ</sup> it <sup>d</sup><sup>τ</sup> s* ) − ∑ *i*∈*I* ∑ *t*∈T *mt i* (*π it* + ∑ *s*∈*I* ∑ *τ*∈*It πs<sup>τ</sup> it <sup>d</sup><sup>τ</sup> s* ) s.t. *π it*+<sup>1</sup> + ∑ *s*∈*I* ∑ *τ*∈*It πs<sup>τ</sup> it*+1*d<sup>τ</sup> s* <sup>≤</sup> (*<sup>π</sup> it* + ∑ *s*∈*I* ∑ *τ*∈*It πs<sup>τ</sup> it <sup>d</sup><sup>τ</sup> <sup>s</sup>* )+(*η it* + ∑ *s*∈*I* ∑ *τ*∈*It ηs<sup>τ</sup> it <sup>d</sup><sup>τ</sup> <sup>s</sup>* ) − *<sup>d</sup><sup>t</sup> i* , ∀*i* ∈ *I*, *t* ∈ {1, ··· , *T* − 1}, 0 ≤ *η it* + ∑ *s*∈*I* ∑ *τ*∈*It ηs<sup>τ</sup> it <sup>d</sup><sup>τ</sup> <sup>s</sup>* ≤ *<sup>P</sup><sup>t</sup> <sup>i</sup>* , ∀*i* ∈ *I*, *t* ∈ T, 0 ≤ ∑ *t*∈T (*η it* + ∑ *s*∈*I* ∑ *τ*∈*It ηs<sup>τ</sup> it <sup>d</sup><sup>τ</sup> <sup>s</sup>* ) ≤ *Qi*, ∀*i* ∈ *I*, *t* ∈ T, *π it* + ∑ *s*∈*I* ∑ *τ*∈*It πs<sup>τ</sup> it <sup>d</sup><sup>τ</sup> <sup>s</sup>* ≥ 0, ∀*i* ∈ *I*, *t* ∈ T, ∑ *i*∈*I π it* + ∑ *s*∈*I* ∑ *τ*∈*It πs<sup>τ</sup> it <sup>d</sup><sup>τ</sup> <sup>s</sup>* ≤ *C*, ∀*t* ∈ T. ⎫ ⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎬ ⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎭ s.t. *π <sup>i</sup>*<sup>1</sup> = 0, ∀*i* ∈ *I*. (9)

In this model, the objective represents the worst-case reward under the variable *d* satisfying all related constraints, i.e., the inner problem in Equation (9). We denote all inequality constraints in Equation (9) as *S*(*η*, *η* , *π*, *π* , *d*) ≥ 0 for short. We can utilize duality theory to deal with this complicated max-min problem. We demonstrate this approach in the following theorem.

**Theorem 2.** *Suppose that, for all fixed η*, *η* , *π, and π concerned in the outer maximizing problem of Equation (9), there exists a* <sup>ˆ</sup>*<sup>d</sup>* <sup>∈</sup> *U, such that*

$$S(\eta, \eta', \pi, \pi', d) \ge 0.$$

*Then the model in Equation (9) is equivalent to the following nonlinear programming problem:*

max *λ*,*η*,*η* ,*π*,*<sup>π</sup>* <sup>∑</sup> *i*∈*I* ∑ *t*∈T [−*c<sup>t</sup> i η it* − *<sup>m</sup><sup>t</sup> i π it* − *<sup>λ</sup><sup>b</sup> itη it* + *<sup>λ</sup><sup>c</sup> it*(*η it* − *<sup>P</sup><sup>t</sup> <sup>i</sup>* ) + *<sup>λ</sup><sup>d</sup> i η i* −*λ<sup>e</sup> itπ it* <sup>+</sup> *<sup>λ</sup><sup>f</sup> t π it* + (<sup>1</sup> <sup>−</sup> *<sup>θ</sup>*)*λga it* <sup>ˆ</sup>*d<sup>t</sup> <sup>i</sup>* <sup>−</sup> (<sup>1</sup> <sup>+</sup> *<sup>θ</sup>*)*λgb it* <sup>ˆ</sup>*d<sup>t</sup> i* ] + ∑ *i*∈*I* ∑ *t*∈{1,··· ,*T*−1} *λa it*(*<sup>π</sup> it*+<sup>1</sup> <sup>−</sup> *<sup>π</sup> it* − *η it*) − ∑ *i*∈*I* (*λ<sup>d</sup> <sup>i</sup> Qi* <sup>+</sup> *<sup>λ</sup>gc <sup>i</sup> Di*) − ∑ *t*∈T *λf t C* s.t. ∑ *i*∈*I* ∑ *t*∈{*τ*+1,··· ,*T*−1} *λa it*(*πs<sup>τ</sup> it* + *<sup>η</sup>s<sup>τ</sup> it* <sup>−</sup> *<sup>π</sup>s<sup>τ</sup> it*+1) − *<sup>λ</sup><sup>a</sup> <sup>s</sup><sup>τ</sup>* <sup>+</sup> *<sup>λ</sup>ga <sup>s</sup><sup>τ</sup>* <sup>−</sup> *<sup>λ</sup>gb <sup>s</sup><sup>τ</sup>* <sup>−</sup> *<sup>λ</sup>gc s* + ∑ *i*∈*I* ∑ *t*∈{*τ*+1,··· ,*T*} [(*λ<sup>b</sup> it* − *<sup>λ</sup><sup>c</sup> it* − *<sup>λ</sup><sup>d</sup> <sup>i</sup>* )*ηs<sup>τ</sup> it* + (*λ<sup>e</sup> it* <sup>−</sup> *<sup>λ</sup><sup>f</sup> <sup>t</sup>* )*πs<sup>τ</sup> it* ] + ∑ *i*∈*I λa iτπs<sup>τ</sup> <sup>i</sup>τ*+<sup>1</sup> = *<sup>P</sup><sup>τ</sup> <sup>s</sup>* − ∑ *i*∈*I* ∑ *t*∈{*τ*+1,··· ,*T*} (*ct i ηs<sup>τ</sup> it* + *<sup>m</sup><sup>t</sup> i πs<sup>τ</sup> it* ), ∀*s* ∈ *I*, *τ* ∈ {1, ··· , *T* − 2} ∑ *i*∈*I πs<sup>τ</sup> iT* (−*λ<sup>a</sup> iT*−<sup>1</sup> <sup>+</sup> *<sup>λ</sup><sup>e</sup> iT* <sup>−</sup> *<sup>λ</sup><sup>f</sup> <sup>T</sup>*) + ∑ *i*∈*I ηs<sup>τ</sup> iT* (*λ<sup>b</sup> iT* − *<sup>λ</sup><sup>c</sup> iT* − *<sup>λ</sup><sup>d</sup> i* ) −*λ<sup>a</sup> <sup>s</sup><sup>τ</sup>* <sup>+</sup> *<sup>λ</sup>ga <sup>s</sup><sup>τ</sup>* <sup>−</sup> *<sup>λ</sup>gb <sup>s</sup><sup>τ</sup>* <sup>−</sup> *<sup>λ</sup>gc <sup>s</sup>* = *P<sup>τ</sup> <sup>s</sup>* − ∑ *i*∈*I* (*c<sup>T</sup> <sup>i</sup> <sup>η</sup>s<sup>τ</sup> iT* + *<sup>m</sup><sup>T</sup> <sup>i</sup> <sup>π</sup>s<sup>τ</sup> iT* ), ∀*s* ∈ *I*, *τ* = *T* − 1, *PT <sup>s</sup>* <sup>=</sup> *<sup>λ</sup>ga sT* <sup>−</sup> *<sup>λ</sup>gb sT* <sup>−</sup> *<sup>λ</sup>gc <sup>s</sup>* , ∀*s* ∈ *I*, *S*(*η*, *η* , *π*, *π* , <sup>ˆ</sup>*d*) <sup>≥</sup> 0, *<sup>λ</sup>* <sup>≥</sup> 0, *<sup>π</sup> <sup>i</sup>*<sup>1</sup> = 0, ∀*i* ∈ *I*. (10)

**Proof.** By the assumption, there must exists a ˆ*d* such that *S*(*η*, *η* , *π*, *π* , <sup>ˆ</sup>*d*) <sup>≥</sup> 0. Therefore, the inner minimization over *d* in Equation (9) is feasible. In addition, it is easy to verify the inner minimization in the model in Equation (9) is also bounded below. For each fixed *η*, *η* , *π* and *π* , we obtain that the strong duality property holds for the inner minimization and then the inner minimization problem can be equivalent to a dual problem (i.e., a maximization problem) by the linear duality theorem. Finally, combining the dual problem with the outer maximization in Equation (9), we can obtain the model in Equation (10). Here we omit detailed derivation since it is an example of the duality theorem in LP.

Even though we reformulate the affinely adjustable robust optimization as a nonconvex programming problem, many commercial nonlinear optimization solvers can be utilized to solve the problem in Equation (10). Besides, we should note that the model in Equation (10) not only involves less variables but also has more practical significance compared with the model in Equation (12) in [22] and the model in Equation (20) in [18].

#### **4. Evaluation for the Proposed Model**

In this section, we apply the proposed robust model of Equation (9) and its equivalent dual form in Equation (10) under the uncertain set *U* to solve a real multi-stage logistics production and inventory process problem to show the superiority of our robust model. Numerical results will show that our proposed model can give an effective strategy so that investors would receive preferable rewards. More details is as follows.

#### *4.1. Experimental Details*

All numerical experiments were run under Matlab version R2015b on a Thinkpad laptop computer with an Intel Core i5 processor at 2.5 GHz with 4 GB RAM. Since the optimization model in Equation (10) is nonconvex and nonlinear, we use the commercial nonlinear optimization solver KNITRO (Available at https://www.artelys.com/en/optimization-tools/knitro) to solve our model.

According to [18], denote logistics products *n* = 10, production planning period *T* = 10, nominal demand ˆ*d<sup>t</sup> <sup>i</sup>* = <sup>100</sup>(<sup>1</sup> + 0.1)*<sup>t</sup>* , and upper bound for demand in asset *i* as *Di* = 2 ∑ *d<sup>t</sup> i* , and

$$m\_i^t = 100(1 + 0.05)^t,\\ c\_i^t = 30(1 + 0.05)^t,\\ m\_i^t = 2(1 + 0.05)^t.$$

$$P\_i^t = \mathfrak{A}00(1+0.05)^t,\\ q\_i = \sum P\_{i'}^t, \\ \mathbb{C} = \sum q\_{i'}$$

Next, we compare our model in Equation (10) with the AARC1 model in [18]. The Affinely Adjustable Robust Counterpart (AARC) is first proposed by Ben-Tal et al. in [24]. AARC model restricts the adjustable variables to be affine functions of the uncertain data and converts the NP-hard Adjustable Robust Counterpart (ARC) problem to be a semi-infinite conic programming. Then it can be reformulated as a computationally tractable problem (typically an LP or a semidefinite problem) which is denoted by AARC1 model in [18]. Since the AARC1 model for this multi-stage logistics production and inventory process problem is an LP, we use the commercial solver CPLEX to solve it. Here we test the two models against different levels of uncertainty, specifically, varying *θ* from 0 to 1 with increment 0.1.

#### *4.2. Results and Evaluations*

We output the optimal objective of the two models vs different uncertainty level *θ* in Figure 1. That is, Figure 1 shows the maximal rewards of two models with different uncertainty levels, respectively. We also plot the histogram of total profit of the 10 periods to comparison more clearly in Figure 2.

**Figure 1.** The comparison between our model (Affinely Adjustable Robust Counterpart (AARC)-Shared) and AARC model in [18].

**Figure 2.** The total profit obtained by two models.

We can see that the maximal rewards decrease along with increasing of the level of uncertainty *θ* for both models. Here it should be clarified that it is a deterministic multi-stage logistics production and inventory process problem when *θ* = 0. Obviously, the optimal value of reward in the deterministic case is lager than ones in any other uncertain cases. It exactly illustrates the meaning of robust as we expect. This is easily understandable because the optimal values of both models can be interpreted as the optimistic estimate of total reward in the worst case, which can be lower and lower as the level of uncertainty increases (i.e., the robust feasible region gets larger and larger). This can be interpreted by Figure 3 which shows the demand *d*<sup>5</sup> *<sup>i</sup>* (the 5th period) with different uncertain level *θ*.

**Figure 3.** The impact of *θ* to uncertain demand (e.g., t = 5).

However, compared with our model, the optimal values solved by AARC1 decrease dramatically as *θ* increasing and specially it can even become negative when *θ* = 0.9 and 1. This is because AARC1 considers its feasible solutions (for *η*, *η* , *π*, *π* ) satisfying each constraint for all *d<sup>t</sup> <sup>i</sup>* ∈ *U*. Figure 4 plots the range of *d<sup>t</sup> <sup>i</sup>* in all 10 periods over *θ* = 0.9.

**Figure 4.** The demand range in all periods over *θ* = 0.9.

Clearly, as *θ* increases, the range of *d<sup>t</sup> <sup>i</sup>* enlarges which make the outer feasible region of AARC1 shrink rapidly. On the other hand, no matter how the company arranges the production and inventory planning, the model in [18] tells people that they will run at a loss in the worst cases when *θ* = 0.9 and 1. This is too conservative to give a production and inventory plan. While, our AARC-Shared model is less conservative to some extent and can give a valid strategy in the production and inventory planning under a larger uncertainty level than the AARC1 model.

#### **5. Conclusions**

In this paper, the robust optimization model with shared uncertain parameters is proposed. Unlike existing robust models, we only consider the worst case of the objective under the constraints sharing the same uncertain variable and regard it as in the inner problem of entire model. In terms of the duality theorem, the proposed robust model can be reformulated to a nonconvex optimization problem step by step.

Compared with existing robust optimization models in [14,16–18,22–24] and so on, the proposed model has two advantages:


**Author Contributions:** Conceptualization, L.X. and Y.Z.; methodology, B.Y.; software, L.X.; validation, L.X., Y.Z., and B.Y.; formal analysis, L.X. and Y.Z.; writing—original draft preparation, Y.Z. and L.X; visualization, L.X.; supervision, B.Y. All authors have read and agreed to the published version of the manuscript.

**Funding:** This research was funded by Natural Science Foundation of Liaoning Province of China (NO. 2019-BS-013), National Natural Science Foundation of China (NO. 11971092) and the Fundamental Research Funds for the Central Universities (No. DLMU3132019323).

**Acknowledgments:** We will thank the anonymous reviewers for taking time off their busy schedule to review this paper.

**Conflicts of Interest:** The authors declare no conflict of interest.

#### **References**


c 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

*Article*
