Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference19 articles.
1. M. L. Balinski,An algorithm for finding all vertices of convex polyhedral sets, SIAM J. Appl. Math. 9 (1961), 72–88.
2. R. G. Bland,New finite pivoting rules for the simplex method, Math. Opns. Res. 2 (1977), 103–107.
3. A. Charnes,Optimality and degeneracy in linear programming, Econometrica 20 (1952), 160–170.
4. G. Dahl and S. Storøy,Enumeration of vertices in the linear programming problem, Report no. 45, Dept. of Math., University of Bergen (1973).
5. G. B. Dantzig, A. Orden and P. Wolfe,Notes on linear programming: part 1 — The generalized simplex method for minimizing a linear form under linear constraints, Pac. J. Math. 5 (1955), 183–195.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献