Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Mathematical Science LPP, Simplex Methods, Duality
Consider the following maximization problem:
maximize: x1 + 3x2
subject to the constraints x1 ≥ 0, x2 ≥ 0 and
x1 + x2 ≤ 6
2x1 + x2 ≤ 8
x1 + 2x2 ≤ 9.
Which of the following is the dual problem?
1
Minimize: 6y1 + 8y2 + 9y3 subject to y1 ≥ 0, y2 ≥ 0, y3 ≥ 0, y1 + 2y2 + yз ≥ 1, y1+ y2 + 2y3 ≥ 3.
2
Minimize: 6y1 + 8y2 + 9y3 subject to y1 ≥ 0, y2 ≥ 0, y3 ≥ 0, y1 + 2y2 + y3 ≥ 3, y1 + y2 + 2y3 ≥ 1.
3
Minimize: 6y1 + 8y2 + 9y3 subject to y1 ≥ 0, y2 ≥ 0, y3 ≥ 0, y1 + 2y2 + y3 ≤ 1, y1 + y2 + 2y3 ≤ 3.
4
Minimize: 9y1 + 8y2 + 6y3 subject to y1 ≥ 0, y2 ≥ 0, y3 ≥ 0, y1 + 2y2 + y3 ≥ 1, y1 + y2 + 2y3 ≥ 3.
5
Question Not Attempted