In LPP the constraints5x4y20x6y4 form

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 28

The graph of inequations

x \leq y

and

y \leq x + 3

is located in

EASY

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 29

A linear programming problem of linear functions deals with

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 30

The number of corner points of the

L . P . P .

Max

Z = 20 x + 3 y

subject to the constraints

x + y \leq 5, 2 x + 3 y \leq 12, x \geq 0, y \geq 0

are

EASY

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 2>Q 1

Shaded region in the following figure is represented by

Question Image

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 2>Q 2

The maximum value of

z = 2 x + 5 y

subject to the constraints

2 x + 5 y \leq 10, x + 2 y \geq 1, x - y \leq 4, x, y \geq 0,

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 2>Q 3

Consider $z = - 2 x - 3 y$ subject to $\frac{x}{2} + \frac{y}{3} \leq 1, \frac{x}{3} + \frac{y}{2} \leq 1, x, y \geq 0$ . The maximum value of $z$ 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 2>Q 4

The solution region satisfied by the inequalities

x + y \leq 5, x \leq 4, y \leq 4, x \geq 0, y \geq 0, 5 x + y \geq 5, x + 6 y \geq 6

is bounded by

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 2>Q 5

Corner points of the feasible region determined by the system of linear constraints are

(0, 3), (1, 1)

and

(3, 0) .

Let

Z = p x + q y,

where

p, q > 0 .

Condition on

p

and

q

so that the minimum of

Z

occurs at

(3, 0)

and

(1, 1)

is

In L.P.P., the constraints $5 x + 4 y \geq 20, x \leq 6, y \leq 4$ form

Important Questions on Linear Programming

Learn and Prepare for any exam you want !

In L.P.P., the constraints 5x+4y≥20, x≤6, y≤4 form

Important Questions on Linear Programming

Learn and Prepare for any exam you want !

In L.P.P., the constraints $5 x + 4 y \geq 20, x \leq 6, y \leq 4$ form