A Note on Chernikova's algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

A Note on Chernikova's algorithm

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1662.pdf (806.04 Ko) Télécharger le fichier

Dates and versions

inria-00074895 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074895 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More