Target Exam

CUET

Subject

-- Mathematics - Section B1

Chapter

Linear Programming

Question:

The LPP: Max. \(z=x_{1}+\frac{5}{2}x_{2}\) subject to \(5x_{1}+3x_{2}\leq 15, -x_{1}+x_{2}\leq 1, 2x_{1}+5x_{2}\leq 10\) and \(x_{1},x_{2}\geq 0\) has

Options:

No possible solution

Infinitely many optimal solutions

a unique optimal solution

an unbounded solution

Correct Answer:

Infinitely many optimal solutions

Explanation: