Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference106 articles.
1. M. Akgül, A note on shadow prices in linear programminig, J. Oper. Res. Soc. 35 (1984) 425–431.
2. W. Altherr, An algorithm for enumerating all vertices of a convex polyhedron, Computing 15 (1975) 181–193.
3. M. Altman, Optimum simplex methods and degeneracy in linear programming, Bull. de l'Acad. Polon. des Sci. 12 (1964) 217–225.
4. P. Armand, Programmation linéaire multicritère et problèmes de la dégénérescence, Thèse de Doctorat de l'Université de Limoges (1991).
5. P. Armand, Bounds for the number of vertices of perturbed polyhedra, Ann. Oper. Res. (1993), this volume.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献