中北大学学报（自然科学版）2017，Vol.38Issue(4)：409-413,5.DOI:10.3969/j.issn.1673-3193.2017.04.003
基于逐步降阶的线性规划的单纯形算法
A Simplex Method Base on Reducing the Constraint Conditions of Linear Programming
摘要
Abstract
Aiming to improve the theory of linear programming with respect to the constraint conditions, a new simple method in solving the large-scale problem ineffective variables was presented.Methods to study the property of optimal slack constraint conditions and optimal tight constraint conditions employing some mathematical tools in linear programming and linear algebra and so forth were used to do numerical tests.The characteristics of the optimal tight constraint conditions, the theorems of identifying optimal slack constraint conditions and a new simple method have been obtained from results.Numerical tests and theory illustrated that identifying and eliminating optimal slack constraint conditions can simplify its constraint conditions and improve the efficiency of solving the problem of linear programming in solving the large-scale problem.关键词
线性规划/单纯形算法/约束条件/最优紧约束条件Key words
linear programming/simplex method/constraint conditions/optimal tight constraint conditions分类
数理科学引用本文复制引用
高引民,陈建斌..基于逐步降阶的线性规划的单纯形算法[J].中北大学学报（自然科学版）,2017,38(4):409-413,5.基金项目
国家自然科学基金资助项目(71572015) （71572015）
