List of top Mathematics Questions on Linear Programmig Problem asked in CUET (UG)

In a Linear Programming Problem (LPP), if the objective function to maximize is \( Z = 3x + 4y \) and the corner points of the feasible bounded region are \( (0,0), (4,0), (2,3), \) and \( (0,4) \), find the maximum value of \( Z \).

For the L.P.P. Maximize \[ z=10x+6y \] subjected to: \[ 3x+y\leq12 \] \[ 2x+5y\leq34 \] \[ x,y\geq0 \] Then the feasible region represented by system of inequalities is:

The corner points of the feasible region determined by $x + y \leq 8$, $2x + y \geq 8$, $x \geq 0$, $y \geq 0$ are $A(0, 8)$, $B(4, 0)$, and $C(8, 0)$. If the objective function $Z = ax + by$ has its maximum value on the line segment $AB$, then the relation between $a$ and $b$ is:

Which one of the following represents the correct feasible region determined by the following constraints of an LPP?
\[ x + y \geq 10, \quad 2x + 2y \leq 25, \quad x \geq 0, \quad y \geq 0 \]