Qus : 1
AMU MCA PYQ
4
The following LPP
Maximize $z = x_1 + x_2$
Subject to
$x_1 + x_2 \le 1$
$-3x_1 + x_2 \ge 3$
$x_1, x_2 \ge 0$
1
has a feasible solution 2
has an optimal solution 3
has basic solution $(x_1=-1,\; x_2=2)$ 4
is infeasible Go to Discussion
AMU MCA Previous Year PYQ
AMU MCA AMU MCA 2020 PYQ
Solution From $-3x_1 + x_2 \ge 3$
$x_2 \ge 3 + 3x_1$
But from $x_1 + x_2 \le 1$
$x_2 \le 1 - x_1$
So we need:
$3 + 3x_1 \le 1 - x_1$
$4x_1 \le -2$
$x_1 \le -\frac{1}{2}$
This contradicts $x_1 \ge 0$
Hence problem is infeasible.
Qus : 6
AMU MCA PYQ
2
Optimal value of the following LPP:
Max $z = 2x_1 + 3x_2$
Subject to
$6x_1 + 5x_2 \le 25$
$x_1 + 3x_2 \le 10$
$x_1, x_2 \ge 0$
1
12 2
13.5 3
11.92 4
12.56 Go to Discussion
AMU MCA Previous Year PYQ
AMU MCA AMU MCA 2025 PYQ
Solution Corner points of feasible region are checked.
Maximum value of $z$ occurs at intersection of
$6x_1 + 5x_2 = 25$ and $x_1 + 3x_2 = 10$.
Substituting gives $x_1 = 2.5$, $x_2 = 3$.
$z = 2(2.5) + 3(3) = 5 + 9 = 13.5$.
Qus : 10
AMU MCA PYQ
3
An $n$-tuple $(x_1,x_2,\dots,x_n)$ which satisfies all the constraints of a linear programming problem and for which the objective function is maximum is called
1
a solution
2
a feasible solution
3
an optimal solution
4
an actual solution Go to Discussion
AMU MCA Previous Year PYQ
AMU MCA AMU MCA 2016 PYQ
Solution Maximum value satisfying constraints ⇒ optimal solution
Final Answer: $\boxed{\text{optimal solution}}$
[{"qus_id":"16789","year":"2025"},{"qus_id":"16802","year":"2025"},{"qus_id":"16846","year":"2024"},{"qus_id":"16847","year":"2024"},{"qus_id":"16946","year":"2022"},{"qus_id":"16947","year":"2022"},{"qus_id":"16950","year":"2022"},{"qus_id":"17165","year":"2020"},{"qus_id":"18271","year":"2018"},{"qus_id":"18393","year":"2016"},{"qus_id":"18394","year":"2016"}]