In simplex, a maximization 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