摘要
基于区间数两两比较的可能度,提出了区间数线性规划的可能有效解和可能弱有效解的定义. 利用极大极小算子来求区间数线性规划的可能弱有效解,并建立了一种求多组弱有效解的模型.给出了 求可能有效解的方法,并对区间数线性规划进行拓展.数值例子验证了该法的有效性和可行性.
By introducing the possibility degree formula for the comparison between two interval numbers, the concepts of the possible effective solution and the possible weak effective solution are presented. Max-min operator is employed to obtain the possible weak effective solution and a model is constructed for obtaining many possible weak effective solutions. An approach to obtaining possible effective solution is proposed and an extension of interval number linear programming is given. A numerical example is shown to demonstrate the effectiveness and feasibility of the technique.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2005年第2期101-106,共6页
Systems Engineering-Theory & Practice
基金
教育部跨世纪优秀人才基金资助
关键词
区间数线性规划
可能度
可能有效解
极大极小算子
interval number linear programming
possibility degree
possible effective solution
max-min operater
