报告人: 申培萍

工作单位: 河南师范大学

报告时间：2018年12月27日16:00

报告地点：数学与统计学院二楼会议室

报告摘要：

A range division and linearization algorithm is considered for solving a class of fractional programming problems (P) with the sum or product of linear ratios objective function. In the algorithm, by dividing the outer space with respect to problem (P) into polynomial many rectangles, the original non-convex problem (P) is transformed and decomposed into a sequence of linear programming problems. In order to improve the computational efficiency of the algorithm, a new accelerating technique is introduced, which deletes a large part of region of the outer space in which there exists no the optimal solution of (P). Moreover, the global convergence of the proposed algorithm is outlined and the computational complexity of it is investigated to demonstrate that it is a fully polynomial time approximation scheme. Finally, the numerical computational results illustrate the feasibility and efficiency of the proposed algorithm.

报告人简介：

申培萍,博士, 教授，博士生导师，中国运筹学会理事，中国运筹学会数学规划分会理事，河南省运筹学会副理事长，河南省数字图形图像学会常务理事，河南省教育厅学术技术带头人。主要从事最优化理论、算法及其在工程领域中的应用研究，特别是对广义分数规划、广义几何规划等问题提出一系列全局优化求解算法。先后主持国家自然科学基金面上项目3项、河南省杰出青年基金、河南省高校科技创新人才支持计划、河南省自然科学基金等多项研究课题。发表研究论文50余篇，其中SCI论文40余篇，独著学术著作《全局优化方法》2006年在科学出版社出版，曾获河南省科学技术进步奖1项，河南省教学成果奖2项等。