The Simplex Method

R. Srinivasan ()
Additional contact information
R. Srinivasan: Indian Institute of Science

Chapter Chapter 3 in Strategic Business Decisions, 2014, pp 23-78 from Springer

Abstract: 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.

Keywords: LP problems; Simplex; Big M; Dual simplex; Degeneracy (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-81-322-1901-9_3

Ordering information: This item can be ordered from
http://www.springer.com/9788132219019

DOI: 10.1007/978-81-322-1901-9_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().