摘要
针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法.该算法利用La-grange对偶理论将原来的非线性非凸优化问题转化为一系列易于求解的线性规划.理论分析和数值算例均表明提出的算法是可行的.
This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem. The algorithm uses Lagrange duality theory to convert the primal nonlinear nonconvex optimization problem into a sequence of linear programming problems,which can be solved very efficiently. Theory analysis and the numerical example show that the proposed algorithm is feasible.
出处
《河南师范大学学报(自然科学版)》
CAS
CSCD
北大核心
2008年第3期131-133,共3页
Journal of Henan Normal University(Natural Science Edition)
基金
国家自然科学基金(10671057)
河南省高校科技创新人才计划
河南省教育厅自然科学基金
关键词
全局优化
比式和
分枝定界
对偶界
global optimization
sum of ratios
branch and bound
duality bound