Theorem 2 in Linear Programming
Trending Questions
Q.
Define optimal (feasible) solution of a linear programming problem.
Q. the area enclosed by the curve |x+y-1|+|2x+y-1|=1 is
Q. For a linear programming problem we got the following shaded region as the feasible region.
Statement : The objective function will have both maximum and minimum value on the shaded region.
Statement : The objective function will have both maximum and minimum value on the shaded region.
- True
- False
Q. For a linear programming problem we got the following shaded region as the feasible region.
Statement : The objective function will have both maximum and minimum value on the shaded region.
Statement : The objective function will have both maximum and minimum value on the shaded region.
- True
- False
Q. The fessible region of LPP is a convex polygon and its two consecutive vertices gives optimum solution the LPP has
- Only one and finite solution
- No solution
- Two solutions
- None of the above
Q. For a linear programming problem we got the following shaded region as the feasible region.
Statement : The objective function will have both maximum and minimum value on the shaded region.
Statement : The objective function will have both maximum and minimum value on the shaded region.
- True
- False
