A discretization iteration approach for solving a class of semivectorial bilevel programming problem


Authors

Yibing Lv - School of Information and Mathematics, Yangtze University, Jingzhou 434023, P. R. China. Jiawei Chen - School of Mathematics and Statistics, Southwest University, Chongqing 400715, P. R. China.


Abstract

The pessimistic optimal solution of the semivectorial bilevel programming problem with no upper level variables in the lower level constraints is concerned. Based on the scalarization techniques and optimal value transforming approach for the lower level problem, the semivectorial bilevel programming problem is transformed into the corresponding infinite-dimensional optimization problem. Then, a discretization iterative algorithm is proposed, and the convergence of the algorithm is also analyzed. The numerical results show that the algorithm is feasible for the pessimistic optimal solution of the semivectorial bilevel programming problem studied.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Yibing Lv, Jiawei Chen, A discretization iteration approach for solving a class of semivectorial bilevel programming problem, Journal of Nonlinear Sciences and Applications, 9 (2016), no. 5, 2888--2899

AMA Style

Lv Yibing, Chen Jiawei, A discretization iteration approach for solving a class of semivectorial bilevel programming problem. J. Nonlinear Sci. Appl. (2016); 9(5):2888--2899

Chicago/Turabian Style

Lv, Yibing, Chen, Jiawei. "A discretization iteration approach for solving a class of semivectorial bilevel programming problem." Journal of Nonlinear Sciences and Applications, 9, no. 5 (2016): 2888--2899


Keywords


MSC


References