Question Error Report

Thank you for reporting, we will resolve it shortly

Back to Question

Q. The L.P. problem Max $z = x_1 + x_2$ such that $ -2x_1 + x_2 \leq 1, x_1 \leq 2, x_1 +x_2 \leq 3$ and $x_1 , x_2 \geq 0$ has

Linear Programming

Solution:

Objective function is same as constraint so there are infinite solutions possible.