Abstract
This paper is devoted to study the mixed dual models for a class of non-smooth multiobjective semi-infinite programming problems in which the index set of the inequality constraints is an arbitrary set not necessarily finite. Weak duality conclusions are derived and proved for mixed type multiobjective dual programs, using the generalized uniform convexity on the functions involved. Some previous duality results for differentiable semi-infinite programming problems turn out to be special cases for the results described in the paper. Furthermore, the vector saddle point theory is discussed for the semi-infinite programming problems. The results extend and improve the corresponding results in the literature.
Sign-in/Register to access full text options 
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.
