摘要
如何求解分式规划的最优解是一个比较困难的问题。本文主要针对一类分式规划问题,利用变换,把求解分式规划的问题转为求解非分式规划的问题,从而降低了求解问题的难度。
In this paper, a method is used for a class of fractional programs. With this method, the fractional programs are transformed into nonfractional programs. This made it easy to solve the fractional programs.
出处
《系统工程》
CSCD
1996年第2期18-20,70,共4页
Systems Engineering
关键词
分式规划
可行解
算法
规划
Fractional programs,Feasible solution,Optimal solution
