针对多类恐怖袭击的机场资源配置问题的松弛算法  

A Relaxation Algorithm for Airport Resource Allocation in Response to Multiple Terrorist Attacks

作　　者：逯婧瑜 闫喜红[1,2] 郭思怡 LU Jingyu;YAN Xihong;GUO Siyi(School of Mathematics and Statistics,Taiyuan Normal University,Jinzhong Shanxi 030619,China;Shanxi Key Laboratory for Intelligent Optimization Computing and Blockchain Technology,Taiyuan Normal University,Jinzhong Shanxi 030619,China)

机构地区：[1]太原师范学院数学与统计学院,山西晋中030619 [2]太原师范学院智能优化计算与区块链技术山西省重点实验室,山西晋中030619

出　　处：《太原师范学院学报（自然科学版）》2023年第4期16-18,96,共4页Journal of Taiyuan Normal University:Natural Science Edition

基　　金：山西省科技创新人才团队专项(202204051002018);山西省回国留学人员科研教研资助项目(2022-170)。

摘　　要：为了提高我国国内机场网络的安全性,针对不同类型恐怖分子且能力互不相同的情况建立双层优化模型,采用松弛割平面算法来求解该模型,数值实验表明了模型和算法的有效性.In order to improve the security of China s domestic airport network,a two-layer optimization model is established for different types of terrorists with different capabilities,and a relaxation cut-plane algorithm is used to solve the model,and numerical experiments show the effectiveness of the model and the algorithm.

关 键 词：机场安全 双层优化模型 资源配置 松弛割平面算法 

分 类 号：O224[理学—运筹学与控制论]