Description: Original simplex method (to be given directly to the initial base variable)
Solving the standard linear programming: max C* X st A* x = b (b> = 0) X> = 0
Input: C is an n-dimensional row vector, A is a coefficient matrix of m* n, b is the m-dimensional column vector, XB Holds initial base variable subscript
Output: x optimal solution (if any) fval optimal value of the state flag solution illustrates the interation solution cycles.
To Search:
File list (Check if you may need any files):
originalsimple.txt
Download