If the minimum value of the objective function $Z = ax + by$ of an LPP occurs at two points $(3, 5)$ and $(5, 3)$, then

If the objective function for an LPP is $Z = 2x + 5y$ and the corner points of the bounded feasible region are (0, 0), (5, 0) , $\left(\dfrac{8}{5},\dfrac{6}{5}\right)$ and (0, 2) then the maximum value of $z$ occurs at

The corner points of the bounded feasible region determined by the system of linear constraints are $(0, 0), (5, 0), (6, 5), (6, 8), (4, 10), (0,8)$. Let $z = 3x - 4y$ be the objective function. Then the minimum value of the objective function z occurs at

The feasible region for a LPP is shown in the figure. The minimum value of Z = 2x - 3y is

If the corner points of the bounded feasible region for an LPP are $(5,0), (0,4), (0,2), (3,4)$, and $(0,7)$, then the minimum value of the objective function $z = 2x+5y$ occurs at :

The maximum value of $z = 5x + 7y$ subjected to constraints $x + y \leq 5$, $x \geq 0$, $y \geq 0$ 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: