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

Question

Quizplus · Accepted Answer

The statement D is correct as per the duality theorem of linear programming, which states that the transpose of the constraint coefficients of the primal become the constraints of the dual and vice versa. However, statements A, B, and C are incorrect because if the primal is a maximization problem, then the dual is a minimization problem; the right-hand side quantities become the dual's objective function coefficients, not the right-hand side itself; and the constraint inequality signs are reversed in the dual.

For Every Primal