Optimization Techniques for Decision-making and Information Security

Solutions of Parametric Set-Valued Optimization Problems of Higher-Order

Author(s): Koushik Das* and Chandal Nahak

Pp: 18-35 (18)

DOI: 10.2174/9789815196320124030005

* (Excluding Mailing and Handling)


We deal with a parametric set-valued optimization problem (in brief, PSOP), where set-valued functions (in brief, SVFs) are used for the constraint and objective functions. We use the idea of higher-order p-cone convexity of SVFs (introduced by Das and Nahak [1] as a generalization of cone convex SVFs. We provide the Karush-Kuhn-Tucker (in brief, KKT) criteria of sufficiency for the presence of the minimizers of the PSOPs under higher-order p- cone convexity assumption. Further, we constitute the duality models of Mond-Weir kind and demonstrate the strong, weak, and converse duality theorems under higher-order contingent epi-derivative and higher-order p-cone convexity assumption to a couple of set-valued optimization problems (in brief, SOPs). We provide some examples to justify our results. As a special case, our results reduce to the existing ones of scalar-valued parametric optimization problems

Keywords: Convex cone, Duality, Set-valued function, Contingent epiderivative.

Related Journals
Related Books
© 2024 Bentham Science Publishers | Privacy Policy