Q. In linear programming problem if all constraints are less than or equal to, then thefeasible region is (Solved)
1. above lines
2. below the lines
3. unbounded
4. none of the above
- b. below the lines
1. above lines
2. below the lines
3. unbounded
4. none of the above