If the objective function for an LPP is max.$(z) = 300x + 700y$ and the corner points for the bounded feasible region are $(6,0)$ $(5,0)$ $(0,6)$ $(4,4)$ and $(0,4)$, then the maximum values of z occurs at :

If a person rides his motorbike $x$ km at 30 km per hour, he has to spend ₹ 3 per kilometer on petrol. If he rides $y$ km at a faster speed of 40 km per hour, the petrol cost increases to ₹ 4 per kilometer. If he has ₹ 100 to spend on petrol and wishes to find the maximum distance he can travel within one hour, then linear programming problem (LPP) formulation is:

The feasible region for an L.P.P is always a/an

The feasible region of an LPP Max $Z = 3x + 2y$ subject to $x \geq 0, y \geq 0, x - 2y \leq 3$ is:

The corner points of the bounded feasible region determined by $x+3y\le60, x+y\ge10, x\le y, x\ge0, y\ge0$ are A(0, 10), B(5, 5), C(15, 15) and D(0, 20). If the objective function $z=ax+by$ has its maximum value on the line segment CD, then the relation between $a$ and $b$ is:

Consider the LPP: Maximize $z = x + y$ subject to the constraints $x + 2y \leq 70$, $2x + y \leq 95$, $x,y \geq 0$. The optimal feasible solution is

Consider the linear programming problem (LPP):

Max Z= 4x + 3y

subject to the constraints:

$x\le 8, y\le 4, x\ge 0, y\ge 0$. At what coordinates will the objective function have optimal solution?