Advantages of dual simplex method in linear programming
Answers
Answered by
21
1) Understanding the dual problem leads to specialized algorithms for some important classes of linear programming problems.
2) The dual can be useful for sensitivity analysis.
3) Sometimes finding an initial feasible solution to the dual is much easier than finding one for the primal.
4) The dual variables give the shadow prices for the primal constraints.
5) Sometimes the dual is just easier to solve.
Hope it may help you!!!!!
Plz mark as brainlest !!!!!!
2) The dual can be useful for sensitivity analysis.
3) Sometimes finding an initial feasible solution to the dual is much easier than finding one for the primal.
4) The dual variables give the shadow prices for the primal constraints.
5) Sometimes the dual is just easier to solve.
Hope it may help you!!!!!
Plz mark as brainlest !!!!!!
Answered by
2
Answer:
There are 3 advantages of dual simplex method in linear programming.
those are as follows:
- Specialization of different algorithms required in the linear programming is very helpful with the help of dual simplex method.
- sensitive analysis is also very highly supported by the dual simplex method.
- finding the single solution for the primal is much difficult than finding an quick solution with the help of dual method.
#SPJ2
Similar questions