9. A constraints in an LPP is expressed as
(a) an equation with = sign
(b) inequality in > sign
(c) inequality in <sign
(d) any of the above.
Answers
Answered by
3
Answer:
ans) c may ve
Step-by-step explanation:
please follow me and thanks me please
Answered by
1
The right response is (d) any of the above.
- The straight imbalances or conditions or impediments on the factors of a direct programming issue are called constraints.
- The conditions x ≥ 0, y ≥ 0 are called non-negative limitations.
- Every one of the imperatives is conveyed as conditions, aside from the non-negative limits. The right-hand side of each requirement condition is non-negative.
- Constraints are conveyed is n the kind of disparities or conditions. A requirement is something that endpoints or controls what you can do.
- On the remote possibility that imperatives in straight programming issues are changed, the issue should be rethought for comparative objective work, and directly following settling, we can notice whether or not the game plan exists.
Similar questions