`x ge 3, y ge 2`

Minimise Z=3 x+5 y such that x+3 y ge 3, x+y ge 2, x, y ge 0

Solve the following Linear Programming Problems graphically : Minimise Z = 3x + 5y such that x+3y ge 3, x+y ge 2, x, y ge 0 .

Minimize Z=3x+5y such that x+3y ge 3, x +y ge 2, x, y ge 0 .

Maximise z=-x+2 y subject to the constraints: x ge 3, x+y ge 5, x+2 y ge 6, y ge 0

Maximise Z=-x+2y , subject to the constrains. x ge 3, x+y ge 5,x+2y ge 6, y ge 0 .

The region represents by the inequalities x ge 6, y ge 3, 2x + y ge 10, x ge 0, y ge 0 is

Maximize z= x+2y subject to contraints x+y ge 5, x ge 3 , x+2y ge 6,y ge 0 is this LPP solvable? Justify your answer

(a) Draw the feasible region of inequation: x + y le 4, x ge 0, y ge 0 (b) Draw the graph of the following LPP: 3x + y le 17, x, y ge 0 (c) Shade the feasible region of LLP: (i) x + 3y ge 3, x + y ge 2, x ge 0, y ge 0 (ii) x + 2y le 8, 3x + 2y le 12, x ge 0, y ge 0