Given the LPP Max Z= `3x_(1)+2x_(2)` subject to the constraints
`2x_(1)+x_(2) le2`
`3x_(1)+4x_(2)ge12`
`x_(1) ge 0 , x_(2)ge0`
Draw the graphs of the constraints

Make a graphical representation of the set of constraints in the following LPP Max Z=2x_(1)+x_(2) Subject to the contraints x_(1)+3x_(2) le 15 3x_(1)-4x_(2)le 12 x_(1) ge 0, x_(2) ge 0 Find the corner points of the convex set of feasible solution.

For L.P.P. maximize z = 4x_(1) + 2X_(2) subject to 3x_(1) + 2x_(2) ge 9, x_(1) - x_(2) le 3,x_(1) ge 0, x_(2) ge 0 has ……

Solve LPP: Maximize Z=5x_1+7x_2 subject to the constrains 3x_1+4x_2le12,x_1,x_2ge0

The minimum value of z=2x_(1)+3x_(2) subjected to the constraints 2x_(1)+7x_(2)ge22,x_(1)+x_(2)ge6,5x_(1)+x_(2)ge10 and x_(1),x_(2)ge0 , is

Maximise Z = 3x + 4y, subject to the constraints : x+y le 1, x ge 0 .

The minimum value of z=2x_(1)+3x_2 subjected to the constraints 2x_(1)+7x_(2)ge22,x_(1)+x_(2)ge6,5x_(1)+x_(2)ge10 and x_(1),x_(2)ge0 , is

The linear programming problem : Maximize z=x_(1)+x_(2) subject to constraints x_(1)+2x_(2)le2000,x_(1)+x_(2)le1500,x_(2)le600,x_(1)ge0 has