In simplex, a minimization problem is optimal when all Delta J, i.e.

1.	In simplex, a minimization problem is optimal when all Delta J, i.e. Cj â€“ Zj values are .
A.	either zero or positive
B.	either zero or negative
C.	only positive
D.	only negative
Answer» B. either zero or negative

Discussion