Question

For a maximisation problem using a simplex table, we know we have reached the optimal solution when the zj - cj row has

a.no positive numbers in it

b.no numbers in it.

c.no non zero numbers in it.

d.no negative numbers in it.

Answer 1

Answer:

no positive numbers in it