For every primal
A)that is a maximization problem,the dual is a minimization problem.
B)the right-hand side quantities become the dual's objective function coefficients.
C)constraint inequality signs are reversed in the dual.
D)the transpose of the constraint coefficients become the dual's constraint coefficients.
E)All of the above

Question

Quizplus · Accepted Answer

All of the above are true statements about the duality theorem in linear programming.

For Every Primal