Optimality and Unified Duality for E-differentiable Vector Optimization Problems over Cones involving Generalized E-convexity
Keywords:
E-differentiable function, Vector optimization over cones, Cone-generalized E-convexity, KKT optimality conditions, Unified Duality
Abstract
This paper explores a new approach to solve a nondifferentiable vector optimization problem over cones by means of an operator E : Rn → Rn which renders differentiability to the considered problem. Some new generalized convexity notions are introduced and employed to obtain necessary and sufficient KKT-type optimality conditions. Further, a unified dual is associated with the considered problem encapsulating both Mond-Weir and Wolfe type duals in the same apparatus and duality results are proved.
Published
2024-07-29
How to Cite
Kapoor, M. (2024). Optimality and Unified Duality for E-differentiable Vector Optimization Problems over Cones involving Generalized E-convexity. Statistics, Optimization & Information Computing, 12(5), 1352-1363. https://doi.org/10.19139/soic-2310-5070-1779
Issue
Section
Research Articles
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).