On the number of solutions generated by the dual simplex method
نویسندگان
چکیده
منابع مشابه
On the number of solutions generated by the dual simplex method
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the dual simplex method with the most negative pivoting rule for LP. The bound is comparable with the bound given by Kitahara and Mizuno (2010) for the primal simplex method. We apply the result to the maximum flow problem and get a strong polynomial bound.
متن کاملOn the Number of Solutions Generated by Dantzig’s Simplex Method for LP with Bounded Variables∗
We give an upper bound for the number of different basic feasible solutions generated by Dantzig’s simplex method (the simplex method with the most negative pivoting rule) for LP with bounded variables by extending the result of Kitahara and Mizuno (2010). We refine the analysis by them and improve an upper bound for a standard form of LP. Then we utilize the improved bound for an LP with bound...
متن کاملthe role of task-based techniques on the acquisition of english language structures by the intermediate efl students
this study examines the effetivenss of task-based activities in helping students learn english language structures for a better communication. initially, a michigan test was administered to the two groups of 52 students majoring in english at the allameh ghotb -e- ravandi university to ensure their homogeneity. the students scores on the grammar part of this test were also regarded as their pre...
15 صفحه اولLower Bounds for the Maximum Number of Solutions Generated by the Simplex Method
Kitahara and Mizuno [3] get upper bounds for the maximum number of different basic feasible solutions generated by Dantzig’s simplex method. In this paper, we obtain lower bounds of the maximum number. Part of the results in this paper are shown in Kitahara and Mizuno [4] as a quick report without proof. They present a simple variant of Klee-Minty’s LP and get a lower bound. In this paper, we e...
متن کاملA bound for the number of different basic solutions generated by the simplex method
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints, the number of variables, and the ratio between the minimum and the maximum values of all the positive elements of primal basic feasible solutions. When the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2012
ISSN: 0167-6377
DOI: 10.1016/j.orl.2012.01.004