List of top Mathematics Questions on Linear Programming Problem asked in KEAM

Consider the Linear Programming Problem: Maximize $Z=x+2y$ Subject to $2x+3y\le12, x\ge0, y\ge0$. The optimal value is} \textit{Note: A stray '0.' from the original document has been removed for clarity.

Consider the Linear Programming Problem (LPP): Maximize $z = 30x + 60y$ subject to constraints $x + 2y \leq 12$, $2x + y \leq 12$, $4x + 5y \geq 20$, $x \geq 0$, $y \geq 0$. Then the number of corner points of the feasible region is

The maximum value of the objective function $z=2x+3y$, when the corner points of the feasible region are (0, 0), (5, 0), (4, 1) and (0, 2), is:

Consider the linear programming problem:
Maximize: \(z = \alpha x + 6y\)
Subject to the constraints
\(3x + 2y \leq 60\)
\(x + 2y \leq 40\)
\(x, y \geq 0\)
If every point in the line segment joining (20, 0) and (10, 15) is optimal solution of the L.P.P, then the value of \(\alpha\) is equal to