Abstract
In section 2.4.1, for the standard form of the LP, it was shown that the dual feasibility and primal optimality conditions are identical and the primal reduced cost vector d is the same as the vector of dual logical variables. In case of CF-1 or CF-2 similar statements are true. This fact can be utilized to introduce some efficient dual algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Maros, I. (2003). The Dual Algorithm. In: Computational Techniques of the Simplex Method. International Series in Operations Research & Management Science, vol 61. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0257-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0257-9_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4990-7
Online ISBN: 978-1-4615-0257-9
eBook Packages: Springer Book Archive