%    file is ex1.m
%   Example for simplex method phases 1 and 2  using  main.m
%  Solves min cx s.t. ax <=,= b, x>=0
%  To solve enter:   ex1       (enters the data in this file)
%    the enter:       main        (to run the simplex method)
pt=6  % pause time between iterations, if pt > 20, then a stop occurs
       %    and user hits return to continue
m1=0  % number of inequality constraints (<=)
m2=3  % number of equality constraints
a=[1  1  0  2  1  1  1
   0  1 -1  1  0 -1  5
   2  0 -1  2 -1  1  1 ] %constraint matrix - inequalities first
b=[3/2  1  1]'  % right-hand side
c=[1  1  1  3  4  5  2]  %cost vector
