Abstract
We consider the homogenized linear feasibility problem, to find an x on the unit sphere satisfying n linear inequalities ai Tx \ge 0. To solve this problem we consider the centers of the inspheres of spherical simplices, whose facets are determined by a subset of the constraints. As a result we find a new combinatorial algorithm for the linear feasibility problem. If we allow rescaling, this algorithm becomes polynomial. We point out that the algorithm also solves the more general convex feasibility problem. Moreover, numerical experiments show that the algorithm could be of practical interest.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Betke, U. Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem. Discrete Comput Geom 32, 317–338 (2004). https://doi.org/10.1007/s00454-004-2878-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-004-2878-4