The numberof convex polygon formed bounding the feasible region of the LPP Max Z30x60y subject to the constraints 5x2y10xy4x0y0 are

MEDIUM

VITEEE

IMPORTANT

Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 16

Corner points of the feasible region for an LPP are $(0, 2), (3, 0), (6, 0), (6, 8)$ and $(0, 5)$ . Let $F = 4 x + 6 y$ be the objective function. Then, the minimum value of $F$ occurs at

MEDIUM

VITEEE

IMPORTANT

Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 17

The point at which the maximum value of

Z = 3 x + 2 y

subject to the constraints

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

obtained is

MEDIUM

VITEEE

IMPORTANT

Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 18

For the constraint of a linear optimising function

z = x_{1} + x_{2},

given by

x_{1} + x_{2} \leq 1, 3 x_{1} + x_{2} \geq 3

and

x_{1}, x_{2} \geq 0

.

MEDIUM

VITEEE

IMPORTANT

Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 19

Which of the following is not a vertex of the positive region bounded by the inequalities

2 x + 3 y \leq 6, 5 x + 3 y \leq 15

and

x, y \geq 0 ?

MEDIUM

VITEEE

IMPORTANT

Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 20

The area of the feasible region for the following constraints $3 y + x \geq 3, x \geq 0, y \geq 0$ will be

MEDIUM

VITEEE

IMPORTANT

Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 21

The maximum value of

z = 4 x + 2 y

subject to constraints

2 x + 3 y \leq 18, x + y \geq 10

and

x, y \geq 0

is

HARD

VITEEE

IMPORTANT

Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 22

The maximum value of

P = x + 3 y

, such that

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

is

MEDIUM

VITEEE

IMPORTANT

Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 23

The maximum value of

z = 6 x + 8 y

subject to constraints

2 x + y \leq 30, x + 2 y \leq 24

and

x \geq 0, y \geq 0

is

The number of convex polygon formed bounding the feasible region of the L.P.P. Max. $Z = 30 x + 60 y$ subject to the constraints $5 x + 2 y \leq 10, x + y \leq 4, x \geq 0, y \geq 0$ are

Important Questions on Linear Programming

Learn and Prepare for any exam you want !

The number of convex polygon formed bounding the feasible region of the L.P.P. Max. Z=30x+60y subject to the constraints 5x+2y≤10, x+y≤4, x≥0, y≥0 are

Important Questions on Linear Programming

Learn and Prepare for any exam you want !

The number of convex polygon formed bounding the feasible region of the L.P.P. Max. $Z = 30 x + 60 y$ subject to the constraints $5 x + 2 y \leq 10, x + y \leq 4, x \geq 0, y \geq 0$ are