Abstract
It is well known that a closed convex set in ℝd can be represented as the solution set of a semi-infinite system of linear inequalities. The topic of this paper is to investigate the connections between the point set in ℝd and the defining system of inequalities. Typical problems of this type are redundancy and minimality of the system and the dimension of the solution set. Furthermore it is investigated what relations can be stated between two polyhedral sets being dual to each other in the linear programming sense. Applications to linear complementarity problems are indicated.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
