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