🛠️ JEE➗ Maths

Linear Programming

4 JEE Maths previous year questions on Linear Programming — free to practice, unlock the correct answer & explanation with Premium.

Q1

The corner points of the feasible region determined by the following system of linear inequalities \( 2 x+y \leq 10, x+3 y \leq 15, x, y \geq 0 \) are \( (0,0),(5,0),(3,4) \) and \( (0,5) \). Let \( Z=p x+q y \), where \( p, q>0 \). Condition on \( p \) and \( q \), so that the maximum of \( Z \) occurs at both \( (3,4) \) and \( (0,5) \), is

a

\( p=q \)

b

\( p=2 q \)

c

\( p=3 q \)

d

\( q=3 p \)

🔒
Answer & explanation — Premium

Unlock this and thousands more solved PYQs.

Unlock · ₹149
Q2

The corner points of the feasible region determined by the following system of linear inequalities \( 2 x+y \leq 10, x+3 y \leq 15, x, y \geq 0 \) are \( (0,0),(5,0),(3,4) \) and \( (0,5) \). Let \( Z=p x+q y \), where \( p, q>0 \). Condition on \( p \) and \( q \), so that the maximum of \( Z \) occurs at both \( (3,4) \) and \( (0,5) \), is

a

\( p=q \)

b

\( p=2 q \)

c

\( p=3 q \)

d

\( q=3 p \)

🔒
Answer & explanation — Premium

Unlock this and thousands more solved PYQs.

Unlock · ₹149
Q3

If the number of available constraints is 3 and the number of parameters to be optimised is 4 , then

a

The objective function can be optimised

b

The constraints are short in number

c

The solution is problem oriented

d

None of the above

🔒
Answer & explanation — Premium

Unlock this and thousands more solved PYQs.

Unlock · ₹149
Q4

If the number of available constraints is 3 and the number of parameters to be optimised is 4 , then

a

The objective function can be optimised

b

The constraints are short in number

c

The solution is problem oriented

d

None of the above

🔒
Answer & explanation — Premium

Unlock this and thousands more solved PYQs.

Unlock · ₹149

Practice more JEE Maths PYQs

Browse every Maths chapter, or explore the full JEE question bank.

➗ All Maths chapters →