Apply simplex algorithm, to determine which variable would be the outgoing variable, when a non-optimal solution is sought to be improved, we select the row which has the smallest non-negative replacement ratio, b/a;p If, in a certain situation, there are no non-negative replacement ratios (so that all of them are negative) or they are equal to oo (for the reason of the denominator equal to zero), then the algorithm terminates. This indicates that the problem under consideration has unbounded solution. Consider the example given below.

Maximise Z = 10x +20x2 Subject to 2x + 4x2 16 x+5x2 15 X1, X20