Answers are grounded in this paper and cite their sources.
Investigates vector optimization under generalized convexity, revealing optimality conditions and implications for problem-solving.
In this paper, a new class of nonconvex vector optimization problems is considered. The concepts of E-B-pseudoinvexity and E-B-quasiinvexity are introduced for E-differentiable functions. Then, the sufficiency of the so-called E-Karush-Kuhn-Tucker optimality conditions is established for the considered E-differentiable vector optimization problems under (generalized) E-B-invexity. To illustrate the aforesaid results, a nonsmooth vector programming problem with E-differentiable functions is studied. For the E-differentiable vector optimization problem, the so-called vector Mond-Weir E-dual problem is defined, and several E-dual theorems are established under (generalized) E-B-invexity hypotheses.
No takes yet. Share an insight, caveat, or question.
Abdulaleem et al. (2023) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: