How is unboundedness detect in solving a problem in linear programming?
This question has been flagged
7
Replies
437
Views
Unboundedness in linear programming is detected when a pivot column shows a positive coefficient in the objective row while all corresponding constraint entries are non-positive, indicating that the objective can increase indefinitely without constraints.
Unboundedness can be detected by feasible region
Unboundedness detected by a feasible region that extend infinitely in one direction.
Unboundedness is detected by a feasible region that extends infinitely in at least one direction
It can be detected by a feasible region
Unboundedness is detected by feasible region
It can be detected by a feasible region