摘要
本文给出了一个求解线性规划问题初始解的算法，该算法是将作者原算法稍加修改而成，与原算法配套组合，即构成一个完整的求解一般线性规划问题的强多项式算法。本文给出的算法同时是判别线性不等式组相容性的一个方法。
In this paper,an algorithm to find the initial solution of linear programming is provided.The algorithm consists of this method and method in [1] is a strongly polynomial algorithmfor linear programming and also a method to distinguish the consistency of linear inequalities.
出处
《长沙交通学院学报》
1995年第3期84-90,共7页
Journal of Changsha Communications University
关键词
初始解
相容性
线性规划
线性不等式组
initial solution
consistency
strongly polynomial algorithm
