DocumentCode :
3174812
Title :
Research on the criterion of identifying infinite optimal solutions in simplex method
Author :
Cheng, Xiao-Hong
Author_Institution :
Inf. Coll., Beijing Wuzi Univ., Beijing, China
fYear :
2010
fDate :
29-30 Oct. 2010
Firstpage :
802
Lastpage :
804
Abstract :
This paper points out the defects in the descriptions in existing operational research textbooks about the criterion of identifying infinite optimal solutions in simplex method and proves its own ideas with simple and straightforward examples. In the end it provides a more precise identifying theorem.
Keywords :
linear programming; operations research; infinite optimal solutions; linear programming; operational research; simplex method; textbooks; criterion of identifying infinite optimal solutions; non-based variable; reduced cost;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Artificial Intelligence and Education (ICAIE), 2010 International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4244-6935-2
Type :
conf
DOI :
10.1109/ICAIE.2010.5641420
Filename :
5641420
Link To Document :
بازگشت