HARD

MHT-CET

IMPORTANT

Earn 100

The maximum of $z = 5 x + 2 y$ subject to the constraints $x + y \leq 7, x + 2 y \leq 10, x, y \geq 0$ is

50% studentsanswered this correctly

Important Questions on Linear Programming

HARD

MHT-CET

IMPORTANT

MHT-CET TRIUMPH Mathematics Multiple Choice Questions Part - 2 Based on Std. XI & XII Syllabus of MHT-CET>Chapter 1 - Linear Programming>Competitive Thinking>Q 20

The maximum value of

2 x + y

is subject to

3 x + 5 y \leq 26

and

5 x + 3 y \leq 30, x \geq 0, y \geq 0

HARD

MHT-CET

IMPORTANT

MHT-CET TRIUMPH Mathematics Multiple Choice Questions Part - 2 Based on Std. XI & XII Syllabus of MHT-CET>Chapter 1 - Linear Programming>Competitive Thinking>Q 21

By the graphical method, the solution of linear programming problem:

Maximize $z = 3 x_{1} + 5 x_{2}$ subject to $3 x_{1} + 2 x_{2} \leq 18, x_{1} \leq 4, x_{2} \leq 6, x_{1} \geq 0, x_{2} \geq 0$ is

HARD

MHT-CET

IMPORTANT

MHT-CET TRIUMPH Mathematics Multiple Choice Questions Part - 2 Based on Std. XI & XII Syllabus of MHT-CET>Chapter 1 - Linear Programming>Competitive Thinking>Q 22

The maximum value of

4 x + 5 y

subject to the constraints

x + y \leq 20, x + 2 y \leq 35, x - 3 y \leq 12

HARD

MHT-CET

IMPORTANT

MHT-CET TRIUMPH Mathematics Multiple Choice Questions Part - 2 Based on Std. XI & XII Syllabus of MHT-CET>Chapter 1 - Linear Programming>Competitive Thinking>Q 23

Maximum value of

z

equals

3 x + 2 y

subject to

x + y \leq 3, x \leq 2, - 2 x + y \leq 1, x \geq 0, y \geq 0

HARD

MHT-CET

IMPORTANT

MHT-CET TRIUMPH Mathematics Multiple Choice Questions Part - 2 Based on Std. XI & XII Syllabus of MHT-CET>Chapter 1 - Linear Programming>Competitive Thinking>Q 24

The point at which the maximum value of

(3 x + 2 y)

subject to the constraints

x + y \leq 2, x \geq 0, y \geq 0

obtained is

HARD

MHT-CET

IMPORTANT

MHT-CET TRIUMPH Mathematics Multiple Choice Questions Part - 2 Based on Std. XI & XII Syllabus of MHT-CET>Chapter 1 - Linear Programming>Competitive Thinking>Q 25

The point which provides the solution of the linear programming problem : Maximise $(45 x + 55 y)$ subject to constraints $x, y \geq 0, 6 x + 4 y \leq 120, 3 x + 10 y \leq 180$ is

HARD

MHT-CET

IMPORTANT

MHT-CET TRIUMPH Mathematics Multiple Choice Questions Part - 2 Based on Std. XI & XII Syllabus of MHT-CET>Chapter 1 - Linear Programming>Competitive Thinking>Q 26

The point which provides the solution to the linear programming problem:

Maximize $P = 2 x + 3 y$ subject to the constraints: $x \geq 0, y \geq 0, 2 x + 2 y \leq 9, 2 x + y \leq 7, x + 2 y \leq 8$ is

EASY

MHT-CET

IMPORTANT

MHT-CET TRIUMPH Mathematics Multiple Choice Questions Part - 2 Based on Std. XI & XII Syllabus of MHT-CET>Chapter 1 - Linear Programming>Competitive Thinking>Q 27

The corner points of the feasible region determined by the system of linear constraints are

(0, 10), (5, 5), (15, 15), (0, 20)

. Let

z = p x + q y

, where

p, q > 0

. Condition on

p

and

q

, so that the maximum of

z

occurs at both the points

(15, 15)

and

(0, 20)

The maximum of z=5x+2y subject to the constraints x+y≤7, x+2y≤10, x, y≥0 is

Important Questions on Linear Programming

Learn and Prepare for any exam you want !

The maximum of $z = 5 x + 2 y$ subject to the constraints $x + y \leq 7, x + 2 y \leq 10, x, y \geq 0$ is