Finding all vertices of a convex polyhedron

descriptionPublicationkeyboard_double_arrow_right Article 01 Oct 1968 Germany English Publisher:Springer Science and Business Media LLCJournal:Numerische Mathematik, volume 12, pages 226-229 (issn: 0029-599X, eissn: 0945-3245,

Copyright policy )

Authors: MANAS, M.; NEDOMA, J.;

doi: 10.1007/bf02162916

Finding all vertices of a convex polyhedron

- Summary
- Subjects
- Metrics

Abstract

The paper describes an algorithm for finding all vertices of a convex polyhedron defined by a system of linear equations and by non-negativity conditions for variables. The algorithm is described using terminology of the theory of graphs and it seems to provide a computationally effective method. An illustrative example and some experiences with computations on a computer are given.

Country

Germany

Related Organizations

Ural Branch of the Russian Academy of Sciences
Russian Federation
DigiZeitschriften
Germany
Institute of Economics
Russian Federation

Keywords

510.mathematics, numerical analysis, Article

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	60
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average