SA

Solve the following linear programming problem graphically: Minimise $Z=x-5y$ subject to the constraints: $x-y\ge0$, $-x+2y\ge2$, $x\ge3$, $y\le4$, $y\ge0$.

MCQ_SINGLE

Of the following, which group of constraints represents the feasible region given below ?

MCQ_SINGLE

The corner points of the feasible region of a Linear Programming Problem are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). If \(Z=ax+by;\) (a, \(b>0)\) be the objective function, and maximum value of Z is obtained at (0, 2) and (3, 0), then the relation between a and b is:

MCQ_SINGLE

In a Linear Programming Problem (LPP), the objective function \(Z=2x+5y\) is to be maximised under the following constraints: \(x+y\le4\), \(3x+3y\ge18\), \(x, y\ge0\). Study the graph and select the correct option. The solution of the given LPP: [Image Missing]

LA

Solve the following Linear Programming Problem graphically: Maximize: \(P = 70x + 40y\) subject to: \(3x + 2y ≤ 9, 3x + y ≤ 9, x ≥ 0, y ≥ 0\)

View All Questions