Convex quadratic bilevel programming problem based on the redesigned BAS algorithm and application to supply chain

被引：0
|
作者：
Wu, Deyu [1 ]
Miao, Peng [1 ]
机构：
[1] Zhengzhou Univ Sci & Technol, Dept Basic Courses, Zhengzhou, Peoples R China
来源：
2023 35TH CHINESE CONTROL AND DECISION CONFERENCE, CCDC | 2023年
关键词：
redesigned BAS algorithm; convex quadratic bilevel programming; supply chain model; KKT; OPTIMIZATION PROBLEMS;
D O I：
10.1109/CCDC58219.2023.10327402
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, convex quadratic bilevel programming problem is studied based on the redesigned beetle antennae search algorithm and applied to the supply chain. Beforhand, the beetle antennae search algorithm is introduced and the convex quadratic bilevel programming problem is proposed. Subsequntly, in order to solve the convex quadratic bilevel programming problem, a redesigned beetle antennae search algorithm is designed. Then, an example is given to show the effectiveness of the redesigned beetle antennae search algorithm. Finally, our method is applied to a supply chain model and the effectiveness of our method is shown as the simulation results.
引用
收藏
页码：1176 / 1181
页数：6
相关论文
共 50 条
  • [41] THE WATERMELON ALGORITHM FOR THE BILEVEL INTEGER LINEAR PROGRAMMING PROBLEM
    Wang, Lizhi
    Xu, Pan
    SIAM JOURNAL ON OPTIMIZATION, 2017, 27 (03) : 1403 - 1430
  • [42] ALGORITHM FOR SOLUTION OF CONVEX PROGRAMMING PROBLEM
    ZUKHOVITSKII, SI
    POLIAK, RA
    PRIMAK, ME
    DOKLADY AKADEMII NAUK SSSR, 1963, 153 (05): : 991 - &
  • [43] Problem of grey bilevel linear programming and its algorithm
    Zhang, En-Lu
    Meng, Xian-Yun
    Li, Zhi-Hui
    Teng, Chun-Xian
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2009, 29 (06): : 132 - 138
  • [44] A LINEAR BILEVEL PROGRAMMING ALGORITHM BASED ON BICRITERIA PROGRAMMING
    UNLU, G
    COMPUTERS & OPERATIONS RESEARCH, 1987, 14 (02) : 173 - 179
  • [45] Convex Quadratic Programming Approach to the Maximum Matching Problem
    Cardoso D.M.
    Journal of Global Optimization, 2001, 21 (1) : 91 - 106
  • [46] Convex Quadratic Programming Approach to the Maximum Matching Problem
    Domingos M. Cardoso
    Journal of Global Optimization, 2001, 19 : 291 - 306
  • [47] Optimality conditions for the simple convex bilevel programming problem in Banach spaces
    Franke, Susanne
    Mehlitz, Patrick
    Pilecka, Maria
    OPTIMIZATION, 2018, 67 (02) : 237 - 268
  • [48] A Genetic Algorithm for Solving Linear-Quadratic Bilevel Programming Problems
    Li, Hecheng
    Wang, Yuping
    NEW TRENDS AND APPLICATIONS OF COMPUTER-AIDED MATERIAL AND ENGINEERING, 2011, 186 : 626 - +
  • [49] A new penalty function algorithm for convex quadratic programming
    BenDaya, M
    AlSultan, KS
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 101 (01) : 155 - 163
  • [50] An Algorithm for Strictly Convex Quadratic Programming with Box Constraints
    XIAOJUN LIU
    YONG-CHANG JIAO
    SATORU FUJISHIGE
    运筹学学报, 1998, (01) : 8 - 22
12345