%0 Journal Article
%T Solution of multi-objective programming with interval coefficients based on satisfactory degree and GA<br>基于满意度和GA的区间系数多目标规划求解*
%A XIA Hao-ran
%A WU Tao
%A <br>夏昊冉
%A 吴涛
%J 计算机应用研究
%D 2010
%I 
%X In the condition of lack of initial knowledge, this paper gave satisfactory degree of constraint function, according to the step of genetic algorithm to solve multi-objective programming, and got non-poor solution set, then according to fitness va-lue, selected the optimal solution. At last, the examples prove the effectiveness and viability of algorithm using the method to solve multi-objective programming with interval coefficients.
%K interval coefficients
%K multi-objective programming
%K satisfactory degree
%K fitness value
%K order
%K Pareto set
%K genetic algorithm<br>区间系数
%K 多目标规划
%K 满意度
%K 适应值
%K 排序
%K Pareto集
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=A0AA8C28E528D8168D85BA1718230F3E&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=708DD6B15D2464E8&sid=56AC59A11354EAA2&eid=E15BC6C12A07D09D&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11