Correct option is B
Given the primal linear program:
The corresponding dual is obtained using the standard maximization – ≤ form.
Step 1: Primal Form
subject to:
The constraint matrix is A, so in the dual, it becomes:
The primal right-hand-side vector b becomes the coefficient vector of the dual objective function.
Step 2: Dual Objective
Since the primal is a maximization problem, its dual is a minimization problem:
Step 3: Dual Constraint
The dual constraint is:
Thus, the complete dual is:
Therefore:
Information Booster
For the standard form:
the dual is:
The key transformations are:
Additional Knowledge
Why the Other Options Are Incorrect?
· (a) Uses but the inequality should be ≥.
· (c) Equality is not appropriate for the given ≤ primal constraints.
· (d) The dual of a maximization problem here is a minimization problem, not maximization.
Primal:
Dual: