Dual Simplex Method

Asoke Kumar Bhunia (), Laxminarayan Sahoo () and Ali Akbar Shaikh ()
Additional contact information
Asoke Kumar Bhunia: The University of Burdwan
Laxminarayan Sahoo: Raniganj Girls’ College
Ali Akbar Shaikh: The University of Burdwan

Chapter Chapter 5 in Advanced Optimization and Operations Research, 2019, pp 109-125 from Springer

Abstract: Abstract The objective of this chapter is to discuss an advanced technique, called the dual simplex method, for solving linear programming problems with ≥ type constraints.

Date: 2019
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:spochp:978-981-32-9967-2_5

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

DOI: 10.1007/978-981-32-9967-2_5

Access Statistics for this chapter

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