The Improvement on R. G. Bland’s Method

Yu-bo Liao ()
Additional contact information
Yu-bo Liao: East China Jiaotong University

Chapter Chapter 84 in The 19th International Conference on Industrial Engineering and Engineering Management, 2013, pp 799-803 from Springer

Abstract: Abstract Cycling may occur when we use the simplex method to solve linear programming problem and meet degeneration. Such cycling problem can be avoided by the Bland method. In this paper, we will present an improved Bland method with more iterative efficiency than the Bland method.

Keywords: Bland method; Linear programming; Linear optimization; Simplex method (search for similar items in EconPapers)
Date: 2013
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-3-642-38391-5_84

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

DOI: 10.1007/978-3-642-38391-5_84

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 ().