COMEDK2017MathematicsLinear Programming
Maximize Z=7 x₁-3 x₂ subject to, x₁+2 x₂ 2,2 x₁+4 x₂ 8, x₁ 0, x₂ 0 .
Options
- AUnique solution
- BUnbounded solution
- CInfeasible solution
- DInfinite number of solutions
Correct answer
C. Infeasible solution
Step-by-step solution
We have, x₁+2 x₂=2 ; 2 x₁+4 x₂=8 i.e., x₁ 2 + x₂ 1 =1, x₁ 4 + x₂ 2 =1 The constraint are shown by the graph From the graph, we conclude that there is no feasible region, i.e. there is no unique solutions satisfying all the constraints.