Graphical Solution of Linear Inequalities of Two Variables
Linear Inequalities and Linear Programming

88552 If Z=10x+25y subject to 0x3,0y3,x+y5,x0,y0 then Z is maximum at the point
is maximum at the point

1 (2,3)
2 (2,4)
3 (1,6)
4 (4,3)
Linear Inequalities and Linear Programming

88553 The L.P.P. to maximize z=x+y subject to x+y1,2x+2y6,x0,y0 has

1 No solution
2 One solution
3 Two solutions
4 Infinite solutions
Linear Inequalities and Linear Programming

88554 The objective function z=4x1+5x2, subject to 2x1+x27,2x1+3x215,x23,x1,x20 has minimum value at the point

1 On X - axis
2 On Y - axis
3 At the origin
4 On the use parallel to x-axis
Linear Inequalities and Linear Programming

88552 If Z=10x+25y subject to 0x3,0y3,x+y5,x0,y0 then Z is maximum at the point
is maximum at the point

1 (2,3)
2 (2,4)
3 (1,6)
4 (4,3)
Linear Inequalities and Linear Programming

88553 The L.P.P. to maximize z=x+y subject to x+y1,2x+2y6,x0,y0 has

1 No solution
2 One solution
3 Two solutions
4 Infinite solutions
Linear Inequalities and Linear Programming

88554 The objective function z=4x1+5x2, subject to 2x1+x27,2x1+3x215,x23,x1,x20 has minimum value at the point

1 On X - axis
2 On Y - axis
3 At the origin
4 On the use parallel to x-axis
Linear Inequalities and Linear Programming

88555 The shaded region is the solution set of the inequalities.

1 5x+4y20,x6,y3,x0,y0
2 5x+4y20,x6,y3,x0,y0
3 5x+4y20,x6,y3,x0,y0
4 5x+4y20,x6,y3,x0,y0
Linear Inequalities and Linear Programming

88552 If Z=10x+25y subject to 0x3,0y3,x+y5,x0,y0 then Z is maximum at the point
is maximum at the point

1 (2,3)
2 (2,4)
3 (1,6)
4 (4,3)
Linear Inequalities and Linear Programming

88553 The L.P.P. to maximize z=x+y subject to x+y1,2x+2y6,x0,y0 has

1 No solution
2 One solution
3 Two solutions
4 Infinite solutions
Linear Inequalities and Linear Programming

88554 The objective function z=4x1+5x2, subject to 2x1+x27,2x1+3x215,x23,x1,x20 has minimum value at the point

1 On X - axis
2 On Y - axis
3 At the origin
4 On the use parallel to x-axis
Linear Inequalities and Linear Programming

88555 The shaded region is the solution set of the inequalities.

1 5x+4y20,x6,y3,x0,y0
2 5x+4y20,x6,y3,x0,y0
3 5x+4y20,x6,y3,x0,y0
4 5x+4y20,x6,y3,x0,y0
NEET Test Series from KOTA - 10 Papers In MS WORD WhatsApp Here
Linear Inequalities and Linear Programming

88552 If Z=10x+25y subject to 0x3,0y3,x+y5,x0,y0 then Z is maximum at the point
is maximum at the point

1 (2,3)
2 (2,4)
3 (1,6)
4 (4,3)
Linear Inequalities and Linear Programming

88553 The L.P.P. to maximize z=x+y subject to x+y1,2x+2y6,x0,y0 has

1 No solution
2 One solution
3 Two solutions
4 Infinite solutions
Linear Inequalities and Linear Programming

88554 The objective function z=4x1+5x2, subject to 2x1+x27,2x1+3x215,x23,x1,x20 has minimum value at the point

1 On X - axis
2 On Y - axis
3 At the origin
4 On the use parallel to x-axis
Linear Inequalities and Linear Programming

88555 The shaded region is the solution set of the inequalities.

1 5x+4y20,x6,y3,x0,y0
2 5x+4y20,x6,y3,x0,y0
3 5x+4y20,x6,y3,x0,y0
4 5x+4y20,x6,y3,x0,y0