Description: Of the original simplex method (big M method, without giving the initial basic variable) Programmed by Liyang (faruto' s Studio ~!) BNU MATH Email: liyangbnu@mail.bnu.edu.cn QQ: 516667408 last modified 2008.4.27 solving standard linear programming: max C* X st A* X = b (b> = 0) X> = 0 input: C is the n-dimensional row vector, A is the coefficient matrix of m* n, b is the m-dimensional column vector
To Search:
File list (Check if you may need any files):
[M].txt
Download