Solve the following Linear Programming Problem using graphical method: Maximise $Z=100x+50y$ subject to the constraints $3x+y\le600$, $x+y\le300$, $y\le x+200$, $x\ge0$, $y\ge0$.

15. The solution set of the inequation $3x+5y

For a Linear Programming Problem (LPP), the given objective function is \(Z=x+2y\). The feasible region PQRS determined by the set of constraints is shown as a shaded region in the graph. \(P\equiv(\frac{3}{13},\frac{24}{13})\) \(Q\equiv(\frac{3}{2},\frac{15}{4})\) \(R\equiv(\frac{7}{2},\frac{3}{4})\) \(S\equiv(\frac{18}{7},\frac{2}{7})\). Which of the following statements is correct?

The number of corner points of the feasible region determined by constraints \(x\ge0, y\ge0, x+y\ge4\) is:

The corner points of the feasible region in graphical representation of a L.P.P. are \((2, 72)\), \((15, 20)\) and \((40, 15)\). If \(Z = 18x + 9y\) be the objective function, then