Q. In simplex, a minimization problem is optimal when all Delta J, i.e. Cj – Zj values are . (Solved)
1. either zero or positive
2. either zero or negative
3. only positive
4. only negative
- a. either zero or positive
1. either zero or positive
2. either zero or negative
3. only positive
4. only negative