If when we are using a simplex table to solve a maximization problem, we find that the ratios for determining the key row are all negative, then we know that the solution is
Answers
Answered by
9
Answer:
, when we are using a Simplex table to solve a maximization problem, we find that the ratios for determining the pivot row are all negative, then we know ...
Answered by
0
If when we are using a Simplex table to solve a maximization problem, we find that the ratios for determining the key row are all negative, then we know that the solution is an unbound solution.
- Simplex Method is a method where we repeat the steps of improvement of an initial feasible solution until we find a more accurate solution. Many types of solutions can be found by this method. One of them is an unbound solution.
- An unbound solution is a solution where the solution with the feasible region is not bounded hence the ratios for determining the key row are all negative.
Similar questions