Q.Solve the following linear programming problem by graphical method (Graph sheet is not required): Minimize $Z = 3x + 5y$ subject to $x + 3y \ge 3$, $x + y \ge 2$ and $x, y \ge 0$.

The feasible corners are $(3,0)$, $\left(\tfrac32,\tfrac12\right)$ and $(0,2)$; evaluating $Z=3x+5y$ gives $9,\,7,\,10$, so the minimum is $Z=7$ at $\left(\tfrac32,\tfrac12\right)$.

Concept. Solve graphically by identifying the corner points of the feasible region defined by the constraints, then apply the corner-point theorem. For an unbounded region we also confirm the objective cannot go lower than the best corner value. This is the standard NCERT Class 12 mathematics graphical LPP method.

Constraints. $x+3y\ge3$, $x+y\ge2$, $x,y\ge0$.

Corner points.

• Line $x+3y=3$ meets the $x$-axis at $(3,0)$; it satisfies $x+y\ge2$ ($3\ge2$) — feasible.
• Line $x+y=2$ meets the $y$-axis at $(0,2)$; it satisfies $x+3y\ge3$ ($6\ge3$) — feasible. …