Partiallyshared pessimistic bilevel multifollower programming: concept, algorithm, and application
 Yue Zheng^{1},
 Zhihui Zhu^{2}Email author and
 Liuyang Yuan^{3}
https://doi.org/10.1186/s1366001509561
© Zheng et al. 2016
Received: 11 August 2015
Accepted: 28 December 2015
Published: 13 January 2016
Abstract
When multiple followers are involved in a bilevel programming problem, the leader’s decision will be affected by the reactions of these followers. For actual problems, the leader in general cannot obtain complete information from the followers so that he may be riskaverse. Then he would need a safety margin to bound the damage resulting from the undesirable selections of the followers. This situation is called a pessimistic bilevel multifollower (PBLMF) programming problem. This research considers a partiallyshared linear PBLMF programming in which there is a partiallyshared variable among the followers. The concept and solution algorithm of such a problem are developed. As an illustration, the partiallyshared linear PBLMF programming model is applied to a company making venture investments.
Keywords
1 Introduction
Bilevel programming plays an exceedingly important role in different application fields, such as transportation, economics, ecology, engineering and others; see [1] and the references therein. It has been developed and researched by many authors; e.g., see the monographs [2–5].
When the set of solutions of the lower level problem does not reduce to a singleton, the leader can hardly optimize his choice unless he knows the follower’s reaction to his choice. In this situation, at least two approaches have been suggested: optimistic (or strong) formulation and pessimistic (or weak) formulation [3, 6, 7]. The pessimistic bilevel programming problem is very difficult [8]. As a result, most research on bilevel programming focuses on the optimistic formulation. Interested readers can refer to [1, 9] and the references therein.
This research focuses on the concept, algorithms and applications of the pessimistic bilevel programming problem. Several relative studies are reviewed for existing results of solutions and approximations results for pessimistic bilevel programming; see [10–15]. For papers discussing optimality conditions, see [16, 17]. Recently, Wiesemann et al. [8] analyzed the structural properties and presented a solvable ϵapproximation algorithm for the independent pessimistic bilevel programming problem. Based on an exact penalty function, Zheng et al. [18] proposed an algorithm for the pessimistic linear bilevel programming problem. C̆ervinka, Matonoha and Outrata [19] developed a new numerical method to compute approximate and socalled relaxed pessimistic solutions to mathematical programming with equilibrium constraints which is a generalized bilevel programming problem.
As is well known, most theoretical and algorithmic contributions to bilevel programming are limited to a specific situation with one leader and one follower. For the actual bilevel programming problems, however, the lower level problem often involves multiple decision makers. For example, in a university, the dean of a faculty is the leader, and aims to minimize the faculty annual budget. All the heads of departments in the faculty are the followers whose aims are maximizing their respective annual budget. The leader chooses an optimal strategy knowing how the followers will react. This is a typical bilevel multifollower (BLMF) programming problem. Note that the research on BLMF has been concentrated in its optimistic formulation. For example, Calvete and Galé [20] discussed the linear BLMF with independent followers and transformed such a problem into a linear bilevel problem with one leader and one follower. Lu et al. [21] generalized a framework for a special kind of BLMF, and identified nine main types of relations among followers. Lu et al. [22] considered a trilevel multifollower programming problem, and analyzed various kinds of relations between decision entities. However, some practical problems need to be modeled as a partiallyshared pessimistic BLMF programming model. Let us consider a simple example as follows.
Example 1.1
Note that the above problem cannot be modeled from the existing approaches. To model such a problem, the proposed study considers a partiallyshared PBLMF programming problem. The main contributions of this study are threefold: (i) the concept of a solution of the general PBLMF programming problem is presented and the related existence theorem is established; (ii) a simple algorithm based on penalty function is developed for solving a partiallyshared linear PBLMF programming problem; and (iii) we apply the proposed partiallyshared linear PBLMF programming problem to a company making venture investments.
The paper is organized as follows. In the next section, the concept of a partiallyshared PBLMF programming problem is introduced, and an equivalently penalty problem inspired from [10, 23–25] is given. In Section 3, we analyze the relationships between the original problem and its penalty problem, and then present a solution algorithm. To illustrate the feasibility and rationality of the proposed partiallyshared linear PBLMF programming model, an example of venture investments is proposed in Section 4. Finally, concluding remarks are provided in Section 5.
2 Concept and penalty function of partiallyshared linear PBLMF
Definition 1
 (a)Constraint region of problem (1):$$\begin{aligned}& S= \bigl\{ (x,y_{1},y_{2},\dots,y_{M},z): x\in X, A_{i}x+B_{i}y_{i}+C_{i}z\leqslant b_{i}, y_{i},z\geqslant0, i=1,2, \dots,M \bigr\} . \end{aligned}$$
 (b)Projection of S onto the leader’s decision space:$$\begin{aligned}& S(X)= \bigl\{ x\in X: \exists(y_{1},y_{2}, \dots,y_{M},z), \mbox{such that } (x,y_{1},y_{2}, \dots,y_{M},z)\in S \bigr\} . \end{aligned}$$
 (c)Feasible set for the ith follower \(\forall x\in S(X)\):$$\begin{aligned}& S_{i}(x)= \bigl\{ (y_{i},z): B_{i}y_{i}+C_{i}z \leqslant b_{i}A_{i}x, y_{i},z\geqslant0 \bigr\} . \end{aligned}$$
 (d)The ith follower’s rational reaction set for \(x\in S(X)\):$$\begin{aligned}& \Psi_{i}(x)= \bigl\{ (y_{i},z): (y_{i},z)\in \operatorname {Arg}\min \bigl[u_{i}^{T}y_{i}+v_{i}^{T}z: (y_{i},z)\in S_{i}(x) \bigr] \bigr\} . \end{aligned}$$
 (e)Inducible region or feasible region of the leader:$$\begin{aligned}& \mathit{IR}= \bigl\{ (x,y_{1},y_{2},\dots,y_{M},z): (x,y_{1},y_{2},\dots,y_{M},z)\in S, (y_{i},z)\in\Psi_{i}(x), i=1,2,\dots,M \bigr\} . \end{aligned}$$
Definition 2
Finally, we find two penalized problems of problem P as follows.
The following section outlines the existence of solutions to problems \(P_{\rho}(x)\), \(P_{\rho}\), \(\tilde{P}_{\rho}\), and P, gives the relationships among them and presents a solution algorithm.
3 Algorithm of partiallyshared linear PBLMF
In order to establish theoretical results, we state the main assumption throughout the paper.
Assumption (A)
S is a nonempty compact polyhedron.
The following three lemmas provide the existence of solutions to problems \(P_{\rho}(x)\), \(P_{\rho}\), and \(\tilde{P}_{\rho}\), respectively.
Lemma 3.1
Under Assumption (A), for each \(x\in S(X)\) and a fixed value of \(\rho>0\), problem \(P_{\rho}(x)\) has at least one solution in \(V(Z_{5}(x))\times V(Z_{4}^{1})\times V(Z_{4}^{2})\).
Proof
Lemma 3.2
Under Assumption (A), for a fixed value of \(\rho>0\), problem \(P_{\rho}\) has at least one solution in \(V(Z_{2}(\rho))\times V(Z_{1}(\rho))\).
Proof
Clearly, problem \(P_{\rho}\) is a disjoint bilinear programming problem whose solution occurs at a vertex of its constraint region [26]. This completes the proof. □
Lemma 3.3
Under Assumption (A), for a fixed value of \(\rho>0\), problem \(\tilde{P}_{\rho}\) has at least one solution.
Proof
Under Assumption (A), it follows from Theorem 4.3 in [3] that \(f_{\rho}(x)\) is continuous. Hence, the result follows immediately from the Weierstrass theorem. □
For any \(\eta>0\), let \(Z_{6}:=\{(x,t): Bt\leqslant\eta(bAx)\}\) and \(Z_{7}:=\{(x,y): By\leqslant bAx\}\). To prove Theorem 3.1, we first provide the following lemma.
Lemma 3.4
For any \(\eta>0\), if \((x^{*}_{\eta},t^{*}_{\eta})\in V(Z_{6})\), then there exists \((x^{*},y^{*})\in V(Z_{7})\), such that \(x^{*}=x^{*}_{\eta}\) and \(t^{*}_{\eta}=\eta y^{*}\).
Proof
Note that \((x^{i}, \eta y^{i})\in Z_{6}\). Hence, (6) implies that \(\hat{r}=1\). Because \((x^{*}_{\eta},t^{*}_{\eta})\) is a vertex of \(Z_{6}\), a contradiction results unless \(\hat{r}=1\).
Therefore, there exists a point \((x^{*},y^{*})\in V(Z_{7})\), such that \(x^{*}=x^{*}_{\eta}\) and \(t^{*}_{\eta}=\eta y^{*}\). This completes the proof. □
Next, the following result relates the solution between problems \(P_{\rho}\) and \(\tilde{P}_{\rho}\).
Theorem 3.1
Proof
Thus, (8)(10) implies that \(x_{\rho}\) is a solution of problem \(\tilde{P}_{\rho}\).
Note that \(Q^{\dagger}\) can be referred to as the constraint region of problem (2) based on Definition 1(a).
Finally, we provide the following result which demonstrates that our penalty method is exact, and also presents the relationships between problems \(\tilde{P}_{\rho}\) and P.
Theorem 3.2
Let Assumption (A) hold, and \(\{x_{\rho}\}\) be a sequence of solutions of problem \(\tilde{P}_{\rho}\). Then there exists \(\rho^{*}>0\), such that for all \(\rho>\rho^{*}\), \(x_{\rho}\) is a solution of problem P.
Proof
Combining the results of Theorems 3.1 and 3.2, we can characterize problem (2) as a particular kind of nonlinear programming problem whose solution is related to a vertex of the constraint region.
Theorem 3.3
Under Assumption (A), there exists a solution \((x^{*} ,y_{1}^{*} ,y_{2}^{*} ,z^{*} )\) of problem (2) such that \(x^{*} \in Q\).
Rather than enumerate all vertices of the set \(Q^{+}\) explicitly, we present the following algorithm which finds a solution to problem (2).
 Step 0.:

Choose \(\rho>0\) and \(\gamma>1\).
 Step 1.:

Solve problem \(P_{\rho}\), and denote the solution by \((x^{\rho},t_{1}^{\rho},t_{2}^{\rho},t_{3}^{\rho},t_{4}^{\rho},t_{5}^{\rho})\).
 Step 2.:

Solve problem \(P_{\rho}(x^{\rho})\), and denote the solution by \((y_{1}^{\rho},y_{2}^{\rho},w_{1}^{\rho},w_{2}^{\rho},z^{\rho})\).
 Step 3.:

If \(\sum_{i=1}^{2} \pi_{i}(x^{\rho},y_{i}^{\rho},w_{i}^{\rho },z^{\rho})=0\), then stop, \((x^{\rho},y_{1}^{\rho},y_{2}^{\rho},z^{\rho})\) is a solution of problem (2). Otherwise, set \(\rho=\gamma\rho\) and proceed to Step 1.
4 An application
In this section, we apply the proposed partiallyshared PBLMF decision making model to a company making venture investments. Consider the investments with a CEO and the selected two departments of the company. All decision entities have individual objectives, constraints, and variables and do not cooperate with one another. The departments within the company are also in an uncooperative situation, but they need to use the same warehouse in this company. The CEO’s decision takes the responses of the selected departments into consideration and aims to maximize the company’s profit. At the same time, the departments fully consider the CEO’s decision, and make a rational response to maximize their own profit. Under incomplete and asymmetric information, the CEO cannot directly observe both departments’ effort and the inventory expense. Then it is difficult for the CEO to design an investment planning model that aims to maximize the company’s profit (or minimize the company’s cost). In this case, the CEO may want to create a safety margin to bound the damage resulting from undesirable selections of the two departments.
 (1)The CEO (Leader)
 •:

Objective \(G_{1}\):

The aim is to maximize the company’s profit.

 •:

Variables \((x_{1},x_{2})\):
 \(x_{1}\)::

How much is used for the CEO’s investment in product 1.
 \(x_{2}\)::

How much is used for the CEO’s investment in product 2.
 •:

Constraint:
 \(H_{1}\leqslant0\)::

The total investment cost for products 1 and 2.
 (2)Two selected departments (Followers) Suppose that both department 1 (for product 1) and department 2 (for product 2) share the same warehouse.
 ⋄:

Department 1:
 •:

Objective \(G_{21}\):

The aim is to maximize his total profit which includes his own profit in product 1 and a fraction of the company’s revenue.

 •:

Variables \((y_{1},z)\):
 \(y_{1}\)::

The effort for completing product 1.
 z::

The inventory expense for product 1.
 •:

Constraints:
 \(H_{21}\leqslant0\)::

The effort and cost of department 1 that links with the CEO’s investments.
 \(H_{22}\leqslant0\)::

The maximum effort of department 1.
 \(H_{23}\leqslant0\)::

The maximum inventory expense in product 1.
 ⋄:

Department 2:
 •:

Objective \(G_{31}\):

The aim is to maximize his total profit which includes his own profit in product 2 and a fraction of the company’s revenue.

 •:

Variables \((y_{2},z)\):
 \(y_{2}\)::

The effort for completing product 2.
 z::

The inventory expense for product 2.
 •:

Constraints:
 \(H_{31}\leqslant0\)::

The effort and cost of department 2 that links with the CEO’s investments.
 \(H_{32}\leqslant0\)::

The maximum effort of department 2.
 \(H_{33}\leqslant0\)::

The maximum inventory expense in product 2.
Choose \(\rho=1\) and \(\gamma=10\). The disjoint bilinear programming problems at Step 1 are solved by a commercial optimization software package BARON [27, 28]. By using the proposed algorithm, it is easy to see that \((x_{1}^{*},x_{2}^{*},y_{1}^{*},y_{2}^{*},z^{*})^{T}=(0,1,0.5, 0, 1)^{T}\) is a solution of problem (19), and the optimal value is 9.
5 Conclusions
This study addresses a partiallyshared linear PBLMF programming problem in which there is a partiallyshared variable among followers. Furthermore, the study presents the concept and a solution algorithm for such a problem. Finally, the partiallyshared PBLMF model is applied to a company making venture investments. For future research, it will be interesting to propose the modified intelligent algorithms for the partiallyshared PBLMF model, to apply the model in various areas, and to explore the concept, algorithms, and applications of a PBLMF model in the referentialuncooperative situation.
Declarations
Acknowledgements
This research was supported by the National Natural Science Foundation of China (Nos. 11501233, 71471140, and 11401450).
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
 Dempe, S: Annottated bibliography on bilevel programming and mathematical problems with equilibrium constraints. Optimization 52, 333359 (2003) MathSciNetView ArticleMATHGoogle Scholar
 Bard, JF: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic, Dordrecht (1998) View ArticleMATHGoogle Scholar
 Dempe, S: Foundations of Bilevel Programming. Nonconvex Optimization and Its Applications Series. Kluwer Academic, Dordrecht (2002) MATHGoogle Scholar
 Dempe, S, Kalashnikov, V, PérezValdés, GA, Kalashnykova, N: Bilevel Programming Problems Theory, Algorithms and Applications to Energy Networks. Springer, Berlin (2015) MATHGoogle Scholar
 Zhang, G, Lu, J, Gao, Y: MultiLevel Decision MakingModels, Methods and Applications. Springer, Berlin (2015) MATHGoogle Scholar
 Loridan, P, Morgan, J: Weak via strong Stackelberg problem: new results. J. Glob. Optim. 8, 263287 (1996) MathSciNetView ArticleMATHGoogle Scholar
 Zheng, Y, Wan, Z, Jia, S, Wang, G: A new method for strongweak linear bilevel programming problem. J. Ind. Manag. Optim. 11, 529547 (2015) MathSciNetView ArticleMATHGoogle Scholar
 Wiesemann, W, Tsoukalas, A, Kleniati, P, Rustem, B: Pessimistic bilevel optimisation. SIAM J. Optim. 23, 353380 (2013) MathSciNetView ArticleMATHGoogle Scholar
 Colson, B, Marcotte, P, Savard, G: An overview of bilevel optimization. Ann. Oper. Res. 153, 235256 (2007) MathSciNetView ArticleMATHGoogle Scholar
 Aboussoror, A, Mansouri, A: Weak linear bilevel programming problems: existence of solutions via a penalty method. J. Math. Anal. Appl. 304, 399408 (2005) MathSciNetView ArticleMATHGoogle Scholar
 Aboussoror, A, Mansouri, A: Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems. RAIRO. Rech. Opér. 42, 87103 (2008) MathSciNetView ArticleMATHGoogle Scholar
 Aboussoror, A, Adly, S, Jalby, V: Weak nonlinear bilevel problems: existence of solutions via reverse convex and convex maximization problems. J. Ind. Manag. Optim. 7, 559571 (2011) MathSciNetView ArticleMATHGoogle Scholar
 Lignola, MB, Morgan, J: Topological existence and stability for Stackelberg problems. J. Optim. Theory Appl. 84, 145169 (1995) MathSciNetView ArticleMATHGoogle Scholar
 Loridan, P, Morgan, J: New results on approximate solutions in twolevel optimization. Optimization 20, 819836 (1989) MathSciNetView ArticleMATHGoogle Scholar
 Loridan, P, Morgan, J: ϵRegularized twolevel optimization problems: approximation and existence results. In: Proceeding of the Fifth FrenchGerman Optimization Conference, pp. 99113. Springer, Berlin (1989) Google Scholar
 Dassanayaka, S: Methods of variational analysis in pessimistic bilevel programming. PhD thesis, Wayne State University (2010) Google Scholar
 Dempe, S, Mordukhovich, BS, Zemkoho, AB: Necessary optimality conditions in pessimistic bilevel programming. Optimization 63, 505533 (2014) MathSciNetView ArticleMATHGoogle Scholar
 Zheng, Y, Wan, Z, Sun, K, Zhang, T: An exact penalty method for weak linear bilevel programming problem. J. Appl. Math. Comput. 42, 4149 (2013) MathSciNetView ArticleMATHGoogle Scholar
 C̆ervinka, M, Matonoha, C, Outrata, JV: On the computation of relaxed pessimistic solutions to MPECs. Optim. Methods Softw. 28, 186206 (2013) MathSciNetView ArticleGoogle Scholar
 Calvete, HI, Galé, C: Linear bilevel multifollower programming with independent followers. J. Glob. Optim. 39, 409417 (2007) View ArticleMATHGoogle Scholar
 Lu, J, Shi, C, Zhang, G: On bilevel multifollower decision making: general framework and solutions. Inf. Sci. 176, 16071627 (2006) MathSciNetView ArticleMATHGoogle Scholar
 Lu, J, Zhang, G, Montero, J, Garmendia, L: Multifollower trilevel decision making models and system. IEEE Trans. Ind. Inform. 8, 974985 (2012) View ArticleGoogle Scholar
 Anandalingam, G, White, DJ: A solution for the linear static Stackelberg problem using penalty function. IEEE Trans. Autom. Control 35, 11701173 (1990) MathSciNetView ArticleMATHGoogle Scholar
 Campelo, M, Dantas, S, Scheimberg, S: A note on a penalty function approach for solving bilevel linear programs. J. Glob. Optim. 16, 245255 (2000) MathSciNetView ArticleMATHGoogle Scholar
 White, DJ, Anandalingam, G: A penalty function for solving bilevel linear programs. J. Glob. Optim. 3, 397419 (1993) MathSciNetView ArticleMATHGoogle Scholar
 Vaish, H, Shetty, CM: The bilinear programming problem. Nav. Res. Logist. Q. 23, 303309 (1976) MathSciNetView ArticleMATHGoogle Scholar
 Sahinidis, NV: BARON 12.6.0: Global Optimization of MixedInteger Nonlinear Programs (User’s Manual) (2013) Google Scholar
 Tawarmalani, M, Sahinidis, NV: A polyhedral branchandcut approach to global optimization. Math. Program. 103, 225249 (2005) MathSciNetView ArticleMATHGoogle Scholar