Mathematical Method of Linear Programming
« Previous Topic: Different Types of Linear Programming Problems Next Topic: Feasible and Infeasible Regions »
Join With Us for More Updates
Linear Inequalities and Linear Programming

88601 A dealer wishes to purchase toys \(A\) and \(B\). He has \(₹ 580\) and has space to store 40 items. A costs \(₹ 75\) and B costs \(₹ 90\). He can make profit of \(₹ 10\) and \(₹ 15\) by selling \(A\) and \(b\) respectively. Assuming that he can sell all the items that he can buy, formulate this as an L.P.P. to maximum the profit.

1 Maximize \(z=10 x+15 y\)
Subject to \(x+y \leq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
2 Maximize \(z=10 x+15 y\)
Subject to \(x+y \geq 40, x \geq 0, y \geq 0,75 x+90 y \geq 580\)
3 Maximize \(z=15 x+10 y\)
Subject to \(x+y \leq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
4 Maximize \(\mathrm{z}=10 \mathrm{x}+15 \mathrm{y}\)
Subject to \(x+y \geq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
MHT CET-2013
Linear Inequalities and Linear Programming

88602 Maximum value of \(Z=9 x+13 y\), Subject to \(2 x+y \leq 10,2 x+3 y \leq 18\) and \(x \geq 0, y \geq 0\) is

1 41
2 78
3 89
4 79
MHT CET-2009
Linear Inequalities and Linear Programming

88603 The maximum value of \(z=3 x+2 y\) subject to \(x+y \leq 7,2 x+3 y \leq 16, x \geq 0, y \geq 0\) is

1 23
2 19
3 21
4 24
MHT CET-2010
Linear Inequalities and Linear Programming

88604 If \(4 x+5 y \leq 20, x+y \geq 3, x \geq 0, y \geq 0\) then maximize \(2 \mathrm{x}+3 \mathrm{y}\)

1 12
2 5
3 0
4 20
MHT CET-2006
For More Updates join with Us
NEET Test Series from KOTA - 10 Papers In MS WORD WhatsApp Here
Linear Inequalities and Linear Programming

88601 A dealer wishes to purchase toys \(A\) and \(B\). He has \(₹ 580\) and has space to store 40 items. A costs \(₹ 75\) and B costs \(₹ 90\). He can make profit of \(₹ 10\) and \(₹ 15\) by selling \(A\) and \(b\) respectively. Assuming that he can sell all the items that he can buy, formulate this as an L.P.P. to maximum the profit.

1 Maximize \(z=10 x+15 y\)
Subject to \(x+y \leq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
2 Maximize \(z=10 x+15 y\)
Subject to \(x+y \geq 40, x \geq 0, y \geq 0,75 x+90 y \geq 580\)
3 Maximize \(z=15 x+10 y\)
Subject to \(x+y \leq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
4 Maximize \(\mathrm{z}=10 \mathrm{x}+15 \mathrm{y}\)
Subject to \(x+y \geq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
MHT CET-2013
Linear Inequalities and Linear Programming

88602 Maximum value of \(Z=9 x+13 y\), Subject to \(2 x+y \leq 10,2 x+3 y \leq 18\) and \(x \geq 0, y \geq 0\) is

1 41
2 78
3 89
4 79
MHT CET-2009
Linear Inequalities and Linear Programming

88603 The maximum value of \(z=3 x+2 y\) subject to \(x+y \leq 7,2 x+3 y \leq 16, x \geq 0, y \geq 0\) is

1 23
2 19
3 21
4 24
MHT CET-2010
Linear Inequalities and Linear Programming

88604 If \(4 x+5 y \leq 20, x+y \geq 3, x \geq 0, y \geq 0\) then maximize \(2 \mathrm{x}+3 \mathrm{y}\)

1 12
2 5
3 0
4 20
MHT CET-2006
NEET DIGITAL LIBRARY
Linear Inequalities and Linear Programming

88601 A dealer wishes to purchase toys \(A\) and \(B\). He has \(₹ 580\) and has space to store 40 items. A costs \(₹ 75\) and B costs \(₹ 90\). He can make profit of \(₹ 10\) and \(₹ 15\) by selling \(A\) and \(b\) respectively. Assuming that he can sell all the items that he can buy, formulate this as an L.P.P. to maximum the profit.

1 Maximize \(z=10 x+15 y\)
Subject to \(x+y \leq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
2 Maximize \(z=10 x+15 y\)
Subject to \(x+y \geq 40, x \geq 0, y \geq 0,75 x+90 y \geq 580\)
3 Maximize \(z=15 x+10 y\)
Subject to \(x+y \leq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
4 Maximize \(\mathrm{z}=10 \mathrm{x}+15 \mathrm{y}\)
Subject to \(x+y \geq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
MHT CET-2013
Linear Inequalities and Linear Programming

88602 Maximum value of \(Z=9 x+13 y\), Subject to \(2 x+y \leq 10,2 x+3 y \leq 18\) and \(x \geq 0, y \geq 0\) is

1 41
2 78
3 89
4 79
MHT CET-2009
Linear Inequalities and Linear Programming

88603 The maximum value of \(z=3 x+2 y\) subject to \(x+y \leq 7,2 x+3 y \leq 16, x \geq 0, y \geq 0\) is

1 23
2 19
3 21
4 24
MHT CET-2010
Linear Inequalities and Linear Programming

88604 If \(4 x+5 y \leq 20, x+y \geq 3, x \geq 0, y \geq 0\) then maximize \(2 \mathrm{x}+3 \mathrm{y}\)

1 12
2 5
3 0
4 20
MHT CET-2006
Join With Us for More Updates
Linear Inequalities and Linear Programming

88601 A dealer wishes to purchase toys \(A\) and \(B\). He has \(₹ 580\) and has space to store 40 items. A costs \(₹ 75\) and B costs \(₹ 90\). He can make profit of \(₹ 10\) and \(₹ 15\) by selling \(A\) and \(b\) respectively. Assuming that he can sell all the items that he can buy, formulate this as an L.P.P. to maximum the profit.

1 Maximize \(z=10 x+15 y\)
Subject to \(x+y \leq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
2 Maximize \(z=10 x+15 y\)
Subject to \(x+y \geq 40, x \geq 0, y \geq 0,75 x+90 y \geq 580\)
3 Maximize \(z=15 x+10 y\)
Subject to \(x+y \leq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
4 Maximize \(\mathrm{z}=10 \mathrm{x}+15 \mathrm{y}\)
Subject to \(x+y \geq 40,75 x+90 y \leq 580, x \geq 0, y \geq 0\)
MHT CET-2013
Linear Inequalities and Linear Programming

88602 Maximum value of \(Z=9 x+13 y\), Subject to \(2 x+y \leq 10,2 x+3 y \leq 18\) and \(x \geq 0, y \geq 0\) is

1 41
2 78
3 89
4 79
MHT CET-2009
Linear Inequalities and Linear Programming

88603 The maximum value of \(z=3 x+2 y\) subject to \(x+y \leq 7,2 x+3 y \leq 16, x \geq 0, y \geq 0\) is

1 23
2 19
3 21
4 24
MHT CET-2010
Linear Inequalities and Linear Programming

88604 If \(4 x+5 y \leq 20, x+y \geq 3, x \geq 0, y \geq 0\) then maximize \(2 \mathrm{x}+3 \mathrm{y}\)

1 12
2 5
3 0
4 20
MHT CET-2006
For More Updates join with Us