|
摘要: |
本文研究了一类带有广义多项式约束的广义分式规划问题.首先将原问题转化为其等价形式,然后利用特殊不等式的有关性质将等价问题转化为易于求解的几何规划问题(GP),并通过求解一系列(GP)问题获得原问题的最优解.最后,给出求解问题的迭代算法以及算法的收敛性分析,数值算例表明提出的算法是可行有效的. |
关键词: 广义分式规划 几何规划 迭代算法 |
DOI: |
分类号:O221.2 |
基金项目:国家自然科学基金(11671122);河南省高校重点科研项目基础研究计划(17A110006). |
|
ITERATIVE ALGORITHM OF GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS WITH POLYNIMIAL CONSTRAINTS |
SHEN Pei-ping,BAN Feng-li
|
Abstract: |
In this article, we consider a class of generalized fractional programming problems with polynomial constraints. First, the original problem is transformed into its equivalent form, and then by using the related properties of special inequalities, the geometric programming problems (GP) which is easy to be solved can be gained. Then the optimal solution of the original problem is gained by means of solving a series of geometric programming problems (GP). Finally, the iterative algorithm and its convergent analysis are given, and numerical results show that the algorithm is feasible and effective. |
Key words: generalized fractional programming geometric programming iterative algorithm |