MCQ
If two constraints do not intersect in the positive quadrant of the graph, then.
- AThe problem is infeasible
- BThe solution is unbounded
- COne of the constraints is redundant
- DNone of the above
Solution:
Any linear programming problem must have the following properties:-1.
The relationship between variables and constraints must be linear2.
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.
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
$\text{None of these}$