×

zbMATH — the first resource for mathematics

An improved vertex enumeration algorithm. (English) Zbl 0477.90035

MSC:
90C05 Linear programming
52Bxx Polytopes and polyhedra
65K05 Numerical mathematical programming methods
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] M. Dyer, Vertex enumeration in mathematical programming: methods and applications, Ph.D. Thesis, University of Leeds, forthcoming.
[2] Dyer, M.E.; Proll, L.G., An algorithm for determining all extreme points of a convex polytope, Math. programming, 12, 81-96, (1977) · Zbl 0378.90059
[3] Dyer, M.E.; Proll, L.G., Vertex enumeration in convex polyhedra: a comparative computational study, (), 23-43
[4] M.E. Dyer and L.G. Proll, Degeneracy and redundancy in a vertex enumeration algorithm, in preparation.
[5] Hadley, G., Linear programming, (1962), Addison-Wesley Reading, MA · Zbl 0102.36304
[6] McKeown, P.G., Vertex ranking algorithms: a computational survey, (), 216-222
[7] McMullen, P.; Shephard, G.C., Convex polytopes and the upper bound conjecture, () · Zbl 0217.46702
[8] Manas, M.; Nedoma, J., Finding all vertices of a convex polyhedron, Numer. math., 12, 226-229, (1968) · Zbl 0165.51801
[9] Mattheiss, T.H., An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities, Operations res., 21, 247-260, (1973) · Zbl 0265.90024
[10] Mattheiss, T.H., Computational results on an algorithm for finding all vertices of a polytope, () · Zbl 0433.90045
[11] Mattheis, T.H.; Rubin, D.S., A survey and comparison of methods for finding all vertices of convex polyhedral sets, () · Zbl 0442.90050
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.