Why does the Dual Simplex method require an artificial bounding constraint or cost vector perturbation when starting with a primal-infeasible, dual-infeasible tableau?
Welcome!
This community is for professionals and enthusiasts of our products and services.
Share and discuss the best content and new marketing ideas, build your professional profile and become a better marketer together.
This question has been flagged
1
Reply
54
Views
Because the Dual Simplex algorithm relies on maintaining dual feasibility as its invariant, an artificial bounding constraint or cost perturbation is required to enforce dual feasibility initially so the algorithm can execute its ratio test and pivot toward primal feasibility.
Enjoying the discussion? Don't just read, join in!
Create an account today to enjoy exclusive features and engage with our awesome community!
Sign up