检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东科技大学化学与环境工程学院,山东青岛266510
出 处:《数学的实践与认识》2008年第18期134-139,共6页Mathematics in Practice and Theory
摘 要:进一步讨论了在保持分派问题最优解不变的情况下,效率矩阵元素的变化范围.这些变化范围是保持分派问题最优解不变的充要条件.This paper discuss method of sensitivity analyses integer assignment problem optimum element and non-optimum element in planning mainly. Provide the change range of optimum element and non-optimum element, but the change ranges of these elements at the same time, all to keep optimum solve the necessary condition not changed, but not sufficient condition. This paper discusses the optimal solution change, after it is changed to elements of efficiency matrix of assigning problem. It discusses the range of change of elements on efficiency matrix, under condition keeps optimal solution of assignment problem. Change these range is it assign question to be optimum to solve change necessary and sufficient condition of taking to keep.
关 键 词:分派问题 最优解 充分必要条件 效率矩阵 最优分派方案 灵敏度分析
分 类 号:O221.4[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.133.138