A simplicial approach to the determination of an integer point of a simplex

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

9 Scopus Citations
View graph of relations



Original languageEnglish
Pages (from-to)403-415
Journal / PublicationMathematics of Operations Research
Issue number2
Publication statusPublished - 1998
Externally publishedYes


We propose an algorithm to find an integer point of a simplex. The algorithm is based on an integer labeling rule and a triangulation of the space. Starting at an integer point, the algorithm leaves it along one of n rays and generates a sequence of adjacent simplices of varying dimension. Within a finite number of iterations, the algorithm either yields an integer point of the simplex or proves that no such point exists.

Research Area(s)

  • Integer labeling, Integer point, Integer programming, Simplex, Triangulation, Variable dimension algorithm