报告题目：Global optimization methods for the minimax linear fractional programming problems

报告人：焦红伟

报告时间：2024年10月05日（周六）15:30开始

报告地点：数学楼315会议室

报告摘要：In this report, we aim to find the global optimal solution of the min-max linear fractional programming problems (MMLFPP), which have numerous applications in many fields of economy and engineering. First of all, by constructing the adaptive branching method and the second-order cone relaxation bounding technique, we propose an adaptive branch-and-bound algorithm to tackle the MMLFPP. Secondly, based on the Charnes-Cooper transformation technique and the outer space branch-and-bound scheme, we propose an outer space algorithm for the MMLFPP. We prove the global convergence of these algorithms and estimate maximum number of iterations in the worst case. Finally, numerical results verify the efficiency of these algorithms.

报告人简介：焦红伟，男，博士，教授，数学学院副院长，河南省青年骨干教师，河南省教育厅学术技术带头人，中国运筹学会数学规划分会理事，中国运筹学会算法软件与应用分会理事，河南省运筹学会常务理事兼青年工作委员会主任。研究方向：最优化理论、算法及应用。近年来，主持国家自然科学基金项目面上项目2项；主持中国博士后科学基金、河南省自然科学基金、河南省重点研发与科技推广等省部级科研项目6项；在《European Journal of Operational Research》、《Journal of Optimization Theory and Applications》、《Journal of Global Optimization》等国内外学术期刊上发表论文80余篇，其中被SCI收录60余篇；在科学出版社出版《全局优化问题的分支定界方法》学术专著1部；获河南省自然科学二等奖1项。