Abstract

Linear semi-infinite programming deals with the optimization of linear functionals on finite-dimensional spaces under infinitely many linear constraints. For such kind of programs, a positive duality gap can occur between them and their corresponding dual problems, which are linear programs posed on infinite-dimensional spaces. This paper exploits some recent existence theorems for systems of linear inequalities in order to obtain a complete classification of linear semi-infinite programming problems from the point of view of the duality gap and the viability of the discretization numerical approach. The elimination of the duality gap is also discussed.

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

Disclaimer: 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.