ID: Class: 12 Subject: Math Topic: Linear Programming Type: Very short (VSA) Year: 2025

Question:

In a Linear Programming Problem, the objective function \(Z=5x+4y\) needs to be maximised under constraints \(3x+y\le6\), \(x\le1\), \(x, y\ge0\). Express the LPP on the graph and shade the feasible region and mark the corner points.