arrow
arrow
arrow
Consider a linear program {max⁡cTx∣Ax≤b}\{\max c^T x \mid Ax \leq b\}{maxcTx∣Ax≤b}​. Which of the following statements is true?
Question

Consider a linear program {maxcTxAxb}\{\max c^T x \mid Ax \leq b\}​. Which of the following statements is true?

A.

the dual program is {minbTyATyc, y0}\{\min b^T y \mid A^T y \leq c,\ y \geq 0\}​​

B.

the dual program is {minbTyATyc, y0}\{\min b^T y \mid A^T y \geq c,\ y \geq 0\}​​

C.

the dual program is {minbTyATy=c, y0}\{\min b^T y \mid A^T y = c,\ y \geq 0\}​​

D.

the dual program is {maxbTyATy=c}\{\max b^T y \mid A^T y = c\}​​

Correct option is B

Given the primal linear program:
max cTxsubject to Axb\boxed{\max \; c^T x \quad \text{subject to } Ax\leq b}​​
The corresponding dual is obtained using the standard maximization – ≤ form.
Step 1: Primal Form
maxcTx\max c^Tx​​
subject to:
AxbAx\leq b​​
The constraint matrix is A, so in the dual, it becomes: ATA^T​​
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:
minbTy\min b^Ty​​
Step 3: Dual Constraint
The dual constraint is: ATycA^Ty\geq c​​
Thus, the complete dual is:
minbTysubject to ATyc,y0\boxed{\min b^Ty\quad\text{subject to }A^Ty\geq c,\quad y\geq0}​​
Therefore:
(b) the dual program is {minbTyATyc, y0}\boxed{\text{(b) the dual program is }\{\min b^Ty\mid A^Ty\geq c,\ y\geq0\}}​​
Information Booster
For the standard form:
maxcTxs.t. Axb, x0\boxed{\max c^Tx\quad\text{s.t. }Ax\leq b,\ x\geq0}​​
the dual is:
minbTys.t. ATyc, y0\boxed{\min b^Ty\quad\text{s.t. }A^Ty\geq c,\ y\geq0}​​
The key transformations are:
maxminAATcb\boxed{\max\leftrightarrow\min}\\\boxed{A\leftrightarrow A^T}\\\boxed{\leq\leftrightarrow\geq}\\\boxed{c\leftrightarrow b}​​
Additional Knowledge
Why the Other Options Are Incorrect?
· (a) Uses ATyc,A^Ty\leq c,​ but the inequality should be ≥.
· (c) Equality ATy=cA^Ty=c​ is not appropriate for the given ≤ primal constraints.
· (d) The dual of a maximization problem here is a minimization problem, not maximization.
Primal: max, Axb, x0\max,\ Ax\leq b,\ x\geq0​​
Dual: min, ATyc, y0\min,\ A^Ty\geq c,\ y\geq0​​

Free Tests

Free
Must Attempt

Basics of Education: Pedagogy, Andragogy, and Hutagogy

languageIcon English
  • pdpQsnIcon10 Questions
  • pdpsheetsIcon20 Marks
  • timerIcon12 Mins
languageIcon English
Free
Must Attempt

UGC NET Paper 1 Mock Test 1

languageIcon English
  • pdpQsnIcon50 Questions
  • pdpsheetsIcon100 Marks
  • timerIcon60 Mins
languageIcon English
Free
Must Attempt

Basics of Education: Pedagogy, Andragogy, and Hutagogy

languageIcon English
  • pdpQsnIcon10 Questions
  • pdpsheetsIcon20 Marks
  • timerIcon12 Mins
languageIcon English
test-prime-package

Access ‘UGC NET Computer Science’ Mock Tests with

  • 60000+ Mocks and Previous Year Papers
  • Unlimited Re-Attempts
  • Personalised Report Card
  • 500% Refund on Final Selection
  • Largest Community
students-icon
527k+ students have already unlocked exclusive benefits with Test Prime!
Our Plans
Monthsup-arrow