Work

A Note on Chernikova's algorithm

Year: 1992
Type: article
Abstract: This paper describes an implementation of Chernikova's algorithm for finding an irredundant set of vertices for a given polyhedron defined by a set of linear inequalities and equations. This algorithm can also be used for the dual problem : given a set of extremal rays and vertices, find the associated irredundant set of facet supporting hyperplanes. The method is an extension of initial Chernikova's algorithm (non negative domain) and is mainly based on the polyhedral cone duality principle. A new en hancement for extremal ray detection is presented together with its effects on a class of polyedra.
Language: English
Open Access status: green
OpenAlex ID: W2272316422
FWCI: 3.563
Cites:
Cited by: 135
Related to: 10