Abstract
We give an overview over how problems connected to degeneracy have been attacked in the literature in connection with extreme point enumeration in a convex polyhedron. We treat both the question of unique pivots and how to attach only one basis to each extreme point.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. L. Balinski,An algorithm for finding all vertices of convex polyhedral sets, SIAM J. Appl. Math. 9 (1961), 72–88.
R. G. Bland,New finite pivoting rules for the simplex method, Math. Opns. Res. 2 (1977), 103–107.
A. Charnes,Optimality and degeneracy in linear programming, Econometrica 20 (1952), 160–170.
G. Dahl and S. Storøy,Enumeration of vertices in the linear programming problem, Report no. 45, Dept. of Math., University of Bergen (1973).
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.
G. B. Dantzig,Linear Programming and Extensions, Princeton Univ. Press, Princeton, New Jersey (1963).
M. E. Dyer and L. G. Proll,An algorithm for determining all extreme points of a convex polytope, Math. Programming 12 (1977), 81–96.
M. E. Dyer and L. G. Proll,Vertex enumeration in convex polyhedra — a comparative computational study, In proceedings of CP77 combinatorial conference, T. B. Boffey, ed., University of Liverpool (1977), 23–43.
M. E. Dyer and L. G. Proll,On degeneracy and redundancy in the Dyer-Proll algorithm for vertex enumeration, Report no. 142, Dept of Computer Studies, University of Leeds (1981).
M. E. Dyer and L. G. Proll,An improved vertex enumeration algorithm, European J. Oper. Res. 9 (1982), 359–368.
S. I. Gass,Comments on the possibility of cycling with the simplex method, Opns. Res. 27 (1979), 848–852.
L. Liusternik and V. Sobolev,Elements of Functional Analysis, Frederick Ungar, New York, New York (1961).
M. Manas and J. Nedoma,Finding all vertices of a convex polyhedron, Num. Math. 12 (1968), 226–229.
T. H. Mattheiss,An algorithm for determining irrelavant constraints and all vertices in systems of linear inequalities, Opns. Res. 21 (1973), 247–260.
T. H. Mattheiss and D. S. Rubin,A survey and comparison of methods for finding all vertices of convex polyhedral sets, Math. Opns. Res. 5 (1980), 167–185.
K. G. Murty,Solving the fixed charge problem by ranking the extreme points, Opns. Res. 16 (1968), 268–279.
S. Storøy,Ranking of vertices in the linear fractional programming problem, BIT 23 (1983), 401–405.
S. W. Wallace,Enumeration algorithm in linear programming, Report in informatics no. 3, Dept. of Mathematics, University of Bergen (1982).
S. W. Wallace,On degeneracy in enumeration, BIT 23 (1983), 267–270.
Author information
Authors and Affiliations
Additional information
Work supported by The Norwegian Fisheries Research Council and The Norwegian Research Council for Science and the Humanities.
Rights and permissions
About this article
Cite this article
Wallace, S.W. Pivoting rules and redundancy schemes in extreme point enumeration. BIT 25, 274–280 (1985). https://doi.org/10.1007/BF01935004
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01935004