The solution of LPP

max.(z) = $5x + 3y$ subject to

$2x + y \leq 6$

$x + y \leq 4$

$x \geq 0, y \geq 0$, is

If the corner points of the bounded feasible region of an LPP with objective function Maximize $z = 2x + 3y$ are (0,0), (1,2) and (1,1), then its optimal value is

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:

For the LPP

Maximise $z = x + y$

subject to $x - y \leq -1$, $-x + y \leq 2$, $x, y \geq 0$, $z$ has :

If the corner points of the bounded feasible region for a Linear Programming Problem (LPP) are A(0,2), B(3, 0), C(2, 3) and D(3, 1), then the maximum value of the objective function $Z = 4x + 2y$ occurs at

The constraints to the LPP are:

A. $3x + 2y \leq 720$

B. $2x + 3y \leq 720$

C. $x + y \leq 300$

D. $x \geq 0$ and $y \geq 0$

E. $x + y \geq 300$

Choose the correct answer from the options given below:

If the objective function for an L.P.P is $Z=2x+5y$ and the corner points for bounded feasible region are (8, 0), (2, 3), (3, 5), and (0, 7), then the minimum value of $Z$ occurs at