You visited us 2 times! Enjoying our articles? Unlock Full Access!

Optimization Problems

The linear pr...

Question

The linear programming problem:
Maximize $z = x_{1} + x_{2}$
Subject to constraints
$x_{1} + 2 x_{2} \leq 2000, x_{1} + x_{2} \leq 1500, x_{2} \leq 600, x_{1} \geq 0$

No feasible solution

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Unique optimal solution

No worries! We‘ve got your back. Try BYJU‘S free classes today!

A finite number of optimal solutions

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Infinite number of optimal solutions

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is D Infinite number of optimal solutions

Suggest Corrections

Similar questions

x_{1} + x_{2} .

X_{1} + X_{2} \leq 5

Z = - P x_{1} + 4 x_{2}

- 3 x_{1} + x_{2} \leq 6

x_{1} + 2 x_{2} \leq 4

x_{2} \leq - 3

x_{1}

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

Maximize z = 3 x_{1} + 2 x_{2}

Subject to:

x_{1} \leq 4

x_{2} \leq 6

3 x_{1} + 2 x_{2} \leq 18

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

x_{1} - x_{2} \leq - 1 - x_{1} + x_{2} \leq 0 x_{1}, x_{2} \geq 0

Join BYJU'S Learning Program