Abstract
This paper deals with systems of an arbitrary (possibly infinite) number of both weak and strict linear inequalities. We analyze the existence of solutions for such kind of systems and show that the large class of convex sets which admit this kind of linear representations (i.e., the so-called evenly convex sets) enjoys most of the well-known properties of the subclass of the closed convex sets. We also show that it is possible to obtain geometrical information on these sets from a given linear representation. Finally, we discuss the theory and methods for those linear optimization problems which contain strict inequalities as constraints.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
