Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Mathematical Science LPP, Simplex Methods, Duality
Consider the linear programming problem
maximize x + 3y, subject to A\(\left(\begin{array}{l} \rm x \\ \rm y\end{array}\right)\) ≤ b,
where A = \(\left(\begin{array}{cc}-1 & -1 \\ 0 & 1 \\ -1 & 1 \\ 1 & 2 \\ 0 & -1\end{array}\right)\) and b = \(\left(\begin{array}{c}-1 \\ 5 \\ 5 \\ 14 \\ 0\end{array}\right)\).
Which of the following statements is true?
1
The objective function attains its maximum at \(\left(\begin{array}{l}0 \\ 5\end{array}\right)\) in the feasible region.
2
The objective function attains its maximum at \(\left(\begin{array}{c}-2 \\ 3\end{array}\right)\) in the feasible region.
3
The objective function attains its maximum at \(\left(\begin{array}{l}1 \\ 0\end{array}\right)\) in the feasible region.
4
The objective function does not attain its maximum at \(\left(\begin{array}{c}14 \\ 0\end{array}\right)\) in the feasible region.
5
Question Not Attempted