Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference30 articles.
1. P. Armand, Bounds on the number of vertices of perturbed polyhedra, Ann. Oper. Res. 47 (1993), this volume.
2. P. Armand, Combinatorial behaviour of perturbed polyhedra in linear programming, C. R. Académie des Sciences, to appear.
3. P. Armand and C. Malivert, Determination of the efficient set in multiobjective linear programming, J. Opt. Theory Apl. 70 (1991) 467–489.
4. M.L. Balinski, An algorithm for finding all vertices of convex polyhedral sets, SIAM J. Appl Math. 9 (1961) 72–88.
5. E.M.L. Beale, Cycling in the dual simplex algorithm, Naval Res. Log. Quarterly 2 (1955) 269–276.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Neural Network-Based Fuzzy Multi-objective Optimisation for Efficiency Evaluation;Mathematical Modeling and Computational Tools;2020
2. Degeneracy Graphs;Encyclopedia of Operations Research and Management Science;2013
3. 10.1007/1-4020-0611-x_224;Encyclopedia of Operations Research and Management Science;2001
4. A reverse search algorithm for the neighborhood problem;Operations Research Letters;1999-08
5. Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule;Journal of Optimization Theory and Applications;1997-08