Document Type
Report
Source Publication Title
Technical Report 276
Abstract
In this note a method for computing approximations by polytopes of the solution set [see pdf for notation] of a system of convex inequalities is presented. It is shown that such approximations can be determined by an algorithm which converges in finitely many steps when the solution set of the given system of inequalities is bounded. In this case, the algorithm generates "inner" and "outer' approximations having the Hausdorff distance to each other (and to the set [see pdf for notation]) not greater than an a priori fixed [see pdf for notation] and having their extremal points in [see pdf for notation] and in the relative exterior of [see pdf for notation], respectively.
Disciplines
Mathematics | Physical Sciences and Mathematics
Publication Date
12-1-1990
Language
English
License
This work is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 4.0 International License.
Recommended Citation
Censor, Yair and Butnariu, Dan, "A Method for Approximating the Solution Set of a System of Convex Inequalities by Polytopes" (1990). Mathematics Technical Papers. 105.
https://mavmatrix.uta.edu/math_technicalpapers/105