Author:
Gal Tomas,Kruse Hermann-Josef,Zörnig Peter
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference35 articles.
1. M. Akgül, “A note on shadow prices in linear programming,”Journal of ORS 35 (1984) 425–431.
2. D.C. Aucamp, D.I. Steinberg, “The computation of shadow prices in linear programming,”J. of ORS 33 (1982) 557–565.
3. D. Avis and V. Chvatal, “Notes on Bland's pivoting rule,”Mathematical Programming 8 (1978) 24–34.
4. E.M.L. Beale, “Cycling in the dual simplex algorithm,”Naval Research Logical Quarterly 2 (1955) 269–276.
5. R.G. Bland, “New finite pivoting rules for the simplex method,”Mathematics of Operations Research 2 (1977) 103–107.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Perturbation of transportation polytopes;Journal of Combinatorial Theory, Series A;2013-09
2. Systematic construction of examples for cycling in the simplex method;Computers & Operations Research;2006-08
3. Degeneracy degrees of constraint collections;Mathematical Methods of Operations Research;2003-08
4. Sensitivity analysis of the optimal assignment;European Journal of Operational Research;2003-08
5. Degenerate optimal basis graphs in linear programming;Applied Mathematics-A Journal of Chinese Universities;2000-06