Abstract
A bilevel linear programming problem with ambiguous lower-level objective function is a sequential decision making under uncertainty of rational reaction. The ambiguous lower-level objective function is assumed that the coefficient vector of the follower lies in a convex polytope. We apply the maximin solution approach and formulate it as a special kind of three-level programming problem. Since an optimal solution exists at a vertex of feasible region, we adopt k-th best method to search an optimal solution. At each iteration of the k-th best method, we check rationality, local optimality and global optimality of the candidate solution. In this study, we propose a global optimality test based on an inner approximation method and compare its computational efficiency to other test methods based on vertex enumeration. We also extensively utilize the history of rationality tests to verify the rationality of the solution in the follower’s problem. Numerical experiments show the advantages of the proposed methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abass, S. A. (2010). An interval number programming approach for bilevel linear programming problem. International Journal of Management Science and Engineering Management, 5(6), 461.
Bard, J. F. (1983). Coordination of a multidivisional organization through two levels of management. Omega, 11(5), 457–468.
Bard, J. F. (1998). Practical bilevel optimization : Algorithms and applications. Nonconvex optimization and its applications (Vol. 30). Dordrecht: Kluwer Academic Publishers.
Ben-Ayed, O., & Blair, C. E. (1990). Computational difficulties of bilevel linear programming. Operations Research, 38(3), 556–560.
Ben-Ayed, O., Blair, C. E., Boyce, D. E., & LeBlanc, L. J. (1992). Construction of a real-world bilevel linear programming model of the highway network design problem. Annals of Operations Research, 34(1), 219–254.
Bialas, W. F., & Karwan, M. H. (1982). On two-level optimization. IEEE Transactions on Automatic Control, 27(1), 211–214.
Calvete, H. I., & Galé, C. (2012). Linear bilevel programming with interval coefficients. Journal of Computational and Applied Mathematics, 236(15), 3751–3762.
Colson, B., Marcotte, P., & Savard, G. (2007). An overview of bilevel optimization. Annals of Operations Research, 153(1), 235–256.
Dempe, S. (2002). Foundations of bilevel programming. Nonconvex optimization and its applications (Vol. 61). Dordrecht: Kluwer Academic.
Hansen, P., Jaumard, B., & Savard, G. (1992). New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13(5), 1194–1217.
Hillestad, R. J., & Jacobsen, S. E. (1980). Reverse convex programming. Applied Mathematics and Optimization, 6(1), 63–78.
Horst, R., & Tuy, H. (1993). Global optimization: Deterministic approaches (2nd ed.). Berlin: Springer.
Inuiguchi, M., & Sariddichainunta, P. (2016). Bilevel linear programming with ambiguous objective function of the follower. Fuzzy Optimization and Decision Making. doi:10.1007/s10700-016-9231-2.
Islam, S. M. N. (1998). Mathematical economics of multi-level optimisation: Theory and application. Heidelberg: Springer.
Jeroslow, R. G. (1985). The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming, 32(2), 146–164.
Labbé, M., & Violin, A. (2015). Bilevel programming and price setting problems. Annals of Operations Research, 11(1), 1–30.
LeBlanc, L. J., & Boyce, D. E. (1986). A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows. Transportation Research Part B: Methodological, 20(3), 259–265.
Migdalas, A. (1995). Bilevel programming in traffic planning: Models, methods and challenge. Journal of Global Optimization, 7(4), 381–405.
Muller, M. E. (1959). A note on a method for generating points uniformly on n-dimensional spheres. Communications of the ACM, 2(4), 19–20.
Nishizaki, I., & Sakawa, M. (1999). Solution concepts and their computational methods in multiobjective two-level linear programming problems. Journal of Optimization Theory and Applications, 103(1), 161–182.
Ren, A., & Wang, Y. (2014). A cutting plane method for bilevel linear programming with interval coefficients. Annals of Operations Research, 223(1), 355–378.
Sariddichainunta, P., & Inuiguchi, M. (2015). The improvement of optimality test over possible reaction set in bilevel linear optimization with ambiguous objective function of the follower. Journal of Advanced Computational Intelligence and Intelligent Informatics, 19(5), 645–654.
Tuy, H. (1987). Convex programs with an additional reverse convex constraint. Journal of Optimization Theory and Applications, 52(3), 463–486.
Tuy, H. (1998). Convex analysis and global optimization. Nonconvex optimization and its applications (Vol. 22). Boston: Springer.
Tuy, H., Migdalas, A., & Värbrand, P. (1993). A global optimization approach for the linear two-level program. Journal of Global Optimization, 3(1), 1–23.
Vaish, H., & Shetty, C. M. (1976). The bilinear programming problem. Naval Research Logistics Quarterly, 23(2), 303–309.
Wang, J., & Du, G. (2011). Research on the method for interval linear bi-level programming based on a partial order on intervals. In 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), pp. 682–686. IEEE.
Acknowledgments
This work was supportd partially be JSPS KAKENHI Grant Number 26350423. The authors thank Syuuji Yamada and Masayoshi Arisawa to introduce us the inner approximation method for the global optimality test.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sariddichainunta, P., Inuiguchi, M. Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function. Ann Oper Res 256, 285–304 (2017). https://doi.org/10.1007/s10479-016-2293-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-016-2293-2