论文信息 - Solving Interval Bilevel Programming Based on Generalized Possibility Degree Formula

Solving Interval Bilevel Programming Based on Generalized Possibility Degree Formula

This study proposes a method for dealing with interval bilevel programming. The generalized possibility degree formula is utilized to cope with interval inequality constraints involved in interval bilevel programming. Then several types of equivalent bilevel programming models for interval bilevel programming can be established according to several typical possibility degree formulas which are corresponding to different risk attitudes of decision makers. Finally, a computational example is provided to illustrate the proposed method.

Xingsi Xue | Aihong Ren

[1] Yuping Wang,et al. A cutting plane method for bilevel linear programming with interval coefficients , 2014, Ann. Oper. Res..

[2] Fang Liu,et al. On possibility-degree formulae for ranking interval numbers , 2018, Soft Comput..

[3] Pedro Larrañaga,et al. Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[4] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[5] Herminia I. Calvete,et al. Linear bilevel programming with interval coefficients , 2012, J. Comput. Appl. Math..

[7] Yuping Wang,et al. An approach based on reliability-based possibility degree of interval for solving general interval bilevel linear programming problem , 2019, Soft Comput..

[8] Samir A. Abass,et al. An interval number programming approach for bilevel linear programming problem , 2010 .

[9] Xingsi Xue,et al. A novel approach based on preference-based index for interval bilevel linear programming problem , 2017, Journal of Inequalities and Applications.