运筹与管理2012，Vol.21Issue(2)：27-30,4.
一个含有多余约束的线性规划问题改进算例
A Renovation Algorithm for the Linear Programmming Model with Redundant Constraint
摘要
Abstract
In order to sufficiently exploit current conditions, the optimal solution can be more optimal in the case of the original constraint condition unchanged. The paper presents two renovation algorithms to deal with linear programming model with redundant constraint: one is to add resource , the other is to subtract resource. A specific example is given.关键词
多余约束/线性规划/单纯型法/资源/改进Key words
redundant constraint/ linear programming/ simplex algorithm/ resource/ improved分类
数理科学引用本文复制引用
戴琳,秦叔明,付英姿..一个含有多余约束的线性规划问题改进算例[J].运筹与管理,2012,21(2):27-30,4.基金项目
国家自然科学资金资助项目(11126309,11126310) （11126309,11126310）
云南省自然科学基金资助项目(2009zc039m,2010zc059) （2009zc039m,2010zc059）
