In a linear programming problem, the corner points of the feasible region, determined by the system of linear inequalities are (0, 0), (5, 0), (3, 4) and (0, 5). Let $z=5x+qy, q>0$ be the objective function. For what value of q the maximum value of z occurs at both (3, 4) and (0, 5)?

If the objective function for a linear programming problem (LPP) is $Z = 4x + 5y$ and the corner points of the bounded feasible region are (9, 0), (4, 3), (2, 5), and (0,8), then the minimum value of Z is:

If $5x + y \leq 100$, $x + y \leq 60$, $x \geq 0$, $y \geq 0$. Then one of the corner points of the feasible region is :

The corner points of the bounded feasible region determined by the system of linear inequalities are $(0,0)$, $(4,0)$, $(2,4)$ and $(0,5)$. If maximum value of $z = ax + by$, where $a,b > 0$, occurs at both $(2,4)$ and $(4,0)$ then

Which one of the following set of constraints represents the shaded region given below?

The solution set of the linear constraints $x - 2y \geq 0, 2x - y \leq -4, x \geq 0$ and $y \geq 0$ is

The corner points of the bounded feasible region determined by the system of linear constraints are (0, 0), (0, 9), (2, 10), (6, 8), (10, 0). If the objective function is $Z=6x+5y$, then (Maximum value of $Z$ – Minimum value of $Z$) is equal to: