Max `Z=3000x_1+2000x_2` Subjected to `x_1+2x_2<=6` `2x_1+x_2<=8` `x_2<=2` `x_2-x_1<=1` `x1,x2>=0`

Solve the following LPP graphically : Maximize Z=3x_(1) +2x_(2) subject to -2x_(1) +x_(2) le 1 x_(1) le 2 x_(1) +x_(2) le 3 x_(1), x_(2) ge 0

Maximize : Z=20x_1+40x_2 "Subject to" :x_1+x_2 le 1 x_1,x_2 ge 0 .

Maximise Z=50x_(1)+60x_(2) Subject to 2x_(1)+3x_(2)le6,x_(1),x_(2)ge0 .

Maximize Z= 6x_1+10x_2 subject to x_1+2x_2gt10,2x_1+2x_2gt12,3x_1+x_2gt8,x_1,x_2gt0

Maximize: Z=10x_1+12x_2+8x_3 "Subject to": x_1+2x_2 le 30 5x_1 -7x_3 ge 12 x_1+x_2 +x_3 = 20 x_1,x_2 ge 0

Consider the following linear programming Problem : Maximize Z=50x_(1)+30x_(2) Subject to 2x_(1)+x_(2)<14,5x_(1)+5x_(2)<=40x_(1)+3x_(2)<=18,x_(1),x_(2)<=0

Sole the following LPP graphically Maximise Z=6x_(1)+7x_(2) Subject to x_(1)+2x_(2)ge2,x_(1),x_(2)ge0 .

Maximize Z =5x_1+6x_2 "Subject to" : 2x_1 +3x_2 le 6 x_1,x_2 ge 0