Abstract
There are many algorithmic methods to solve LP problems. The graphical method forms the basis for development of algebraic simplex method. The simplex method is a systematic algorithm moving from one basic feasible solution to another so that the objective function value is improved. In this chapter, we will understand the simplex method of solving LP problems through both the iterative and graphical procedures. We will also evaluate the Big M method, duality, and dual simplex method. A few special cases will also be discussed, including infeasible solutions, unbounded solutions, multiple optimal solutions, and degeneracy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer India
About this chapter
Cite this chapter
Srinivasan, R. (2014). The Simplex Method. In: Strategic Business Decisions. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1901-9_3
Download citation
DOI: https://doi.org/10.1007/978-81-322-1901-9_3
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1900-2
Online ISBN: 978-81-322-1901-9
eBook Packages: Business and EconomicsBusiness and Management (R0)