摘要
单纯形法和Ｋａｒｍａｒｋａｒ算法及其变形算法是解线性规划问题的三个不同算法，本文从实例出发，对三种算法进行了比较和分析。
There are three different methods to solve linear programming problems:simplical method,Karmarkar and the transmutative algorithm.The paper makes comparison and analysis through examples.
出处
《东北电力学院学报》
1997年第1期28-33,共6页
Journal of Northeast China Institute of Electric Power Engineering
