Question

If two constraints do not intersect in the positive quadrant of the graph, then

• A. The problem is infeasible
• B. The solution is unbounded
• C. One of the constraints is redundant
• D. None of the above

Answer 1

The correct option is A The problem is infeasible

Any linear programming problem must have the following properties:-

1. The relationship between variables and constraints must be linear.

2. The constraints must be non-negative.

3.. objective function must be linear.

Non-negativity conditions are used because the variables cannot take negative values. i.e., it is not possible to have negative resources(land, capital, labour cannot be negative).

Because of the non-negativity condition, the feasible region exists only in I quadrant.