HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Note on Chernikova's algorithm

Hervé Le Verge 1
1 API - Parallel VLSI Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:49:33 PM
Last modification on : Friday, February 4, 2022 - 3:15:06 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 7:57:40 PM


  • HAL Id : inria-00074895, version 1


Hervé Le Verge. A Note on Chernikova's algorithm. [Research Report] RR-1662, INRIA. 1992. ⟨inria-00074895⟩



Record views


Files downloads