Optimization

113Linear Programming

________________________________________

basic_set =

3 4 1

nonbasic_set =

2 5

Table =

1 0 0 1 -3 1

0 1 0 2 -1 5

0 0 1 0 1 3

Cost =

0 0 0 0 6 18

------SOLUTION------

basic_set =

3 4 1

xb =

1

5

3

zz =

-18

The simplex method converges to the optimal solution in one iteration and

the minimum value of the objective function is –18. Observe from the output

that at the end of the rst iteration the cost coefcient corresponding to the

nonbasic variable x

2

is zero as compared to another nonbasic variable x

5

that

has a value of 6. Allow the MATLAB code (simplex.m) to be executed for one

more iteration by commenting the terminating criterion as follows:

% if cn_cap >=0

% break;

% end

The output obtained in the se ...