Int. J. Simul. Multidisci. Des. Optim.
Volume 11, 2020
|Number of page(s)||7|
|Published online||10 August 2020|
Optimality and duality for nonsmooth semi-infinite E-convex multi-objective programming with support functions
Department of Mathematics, Faculty of Science, Jouf University, P.O. Box 2014, Sakaka, Saudi Arabia
2 Department of Mathematics, Faculty of Science, Suez University, P.O. Box 43533, Suez, Egypt
* e-mail: email@example.com
Accepted: 29 June 2020
In this paper, we study a nonsmooth semi-infinite multi-objective E-convex programming problem involving support functions. We derive sufficient optimality conditions for the primal problem. We formulate Mond-Weir type dual for the primal problem and establish weak and strong duality theorems under various generalized E-convexity assumptions.
Key words: Nonsmooth semi-infinite multi-objective optimization / generalized e-convexity / duality
© T. Emam, published by EDP Sciences, 2020
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.