Implementation of Motzkin-Burger algorithm in Maple
Computational Geometry
2007-05-23 v1 Computational Complexity
Symbolic Computation
Abstract
Subject of this paper is an implementation of a well-known Motzkin-Burger algorithm, which solves the problem of finding the full set of solutions of a system of linear homogeneous inequalities. There exist a number of implementations of this algorithm, but there was no one in Maple, to the best of the author's knowledge.
Cite
@article{arxiv.cs/0501003,
title = {Implementation of Motzkin-Burger algorithm in Maple},
author = {P. A. Burovsky},
journal= {arXiv preprint arXiv:cs/0501003},
year = {2007}
}
Comments
9 pages, 4 additional text files