Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions

  • S. K. MISHRA Department of Mathematics, Institute of science, Banaras Hindu University, Varanasi-221005, India.

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. We also discuss some special cases from these results.
Keywords: Nonsmooth semi-infinite multiobjective optimization; Generalized convexity, Duality.

Published
2017-06-06
How to Cite
MISHRA, S. K.. Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions. Yugoslav Journal of Operations Research, [S.l.], v. 27, n. 2, p. 205–218, june 2017. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/146>. Date accessed: 09 mar. 2025.
Citation Formats
Issue
Vol 27 No 2 (2017)
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.