Question Error Report

Thank you for reporting, we will resolve it shortly

Back to Question

Q. The solution for minimizing the function $z = x + y $ under a L.P.P. with constraints $x + y \geq 1 , x+ 2y \leq 10 , y \leq 4 $ and $x, y \geq 0 , $ is

Linear Programming

Solution:

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