Write a MATLAB program that implements phase II of the simplex method in matrix form (as presented in class) for the solution of general linear programs (with b 0) in standard form: max c T x s.t. Ax b x 0 Here, c R n , A R mn , and b R m is such that b 0. Structure your program such that the following two pivoting rules can be used: The largest-coefficient pivoting rule. Use your program to solve the following linear programs: (DO NOT USE linprog from matlab library!)

1) The linear program with data: A = [1 3 0 1 ; 2 1 0 0 ; 0 1 4 1 ]; b = [4;3;3]; c = [1;4;1;3];