Abstract
In this paper, we consider a nonsmooth semi-infinite multiobjective programming problem involving support functions. We establish sufficient optimality conditions for the primal problem. We formulate Mond-Weir type dual for the primal problem and establish weak, strong and strict converse duality theorems under various generalized convexity assumptions. Moreover, some special cases of our problem and results are presented.
Author supplied keywords
Cite
CITATION STYLE
Singh, Y., Mishra, S. K., & Lai, K. K. (2017). Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions. Yugoslav Journal of Operations Research, 27(2), 205–218. https://doi.org/10.2298/YJOR170121010S
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.