The graphical solution set for the system of inequations $x-2y \leq 2$,$5x+2y \geq 10$,$4x+5y \leq 20$,$x \geq 0$,$y \geq 0$ is given by

$A$ factory makes tennis rackets and cricket bats. $A$ tennis racket takes $1.5\, \text{hours}$ of machine time and $3\, \text{hours}$ of craftsman's time in its making, while a cricket bat takes $3\, \text{hours}$ of machine time and $1\, \text{hour}$ of craftsman's time. In a day, the factory has the availability of not more than $42\, \text{hours}$ of machine time and $24\, \text{hours}$ of craftsman's time. What number of rackets and bats must be made if the factory is to work at full capacity?

The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

The maximum value of $z = 3x + 5y$ subject to the constraints $3x + 2y \leq 18$,$x \leq 4$,$y \leq 6$,$x, y \geq 0$,is

$A$ man rides his motorcycle at the speed of $50 \, km/h$. He has to spend $Rs. \, 2$ per $km$ on petrol. If he rides it at a faster speed of $80 \, km/h$,the petrol cost increases to $Rs. \, 3$ per $km$. He has at most $Rs. \, 120$ to spend on petrol and one hour's time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem.

Solve the following linear programming problem graphically:
Maximise $Z = 4x + y$......$(1)$
subject to the constraints:
${x + y \leqslant 50}$.......$(2)$
${3x + y \leqslant 90}$......$(3)$
${x \geqslant 0, y \geqslant 0}$......$(4)$