Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions (Q469982): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: We consider a nonsmooth multiobjective programming problem where the functions involved are nondifferentiable. The class of univex functions is generalized to a far wider class of \((\varphi, \alpha, \rho, \sigma)\)-\(d_I\)-\(V\)-type I univex functions. Then, through various nontrivial examples, we illustrate that the class introduced is new and extends several known classes existing in the literature. Based upon these generalized functions, Karush-Kuhn-Tucker type sufficient optimality conditions are established. Further, we derive weak, strong, converse, and strict converse duality theorems for Mond-Weir type multiobjective dual program. | |||
| Property / review text: Summary: We consider a nonsmooth multiobjective programming problem where the functions involved are nondifferentiable. The class of univex functions is generalized to a far wider class of \((\varphi, \alpha, \rho, \sigma)\)-\(d_I\)-\(V\)-type I univex functions. Then, through various nontrivial examples, we illustrate that the class introduced is new and extends several known classes existing in the literature. Based upon these generalized functions, Karush-Kuhn-Tucker type sufficient optimality conditions are established. Further, we derive weak, strong, converse, and strict converse duality theorems for Mond-Weir type multiobjective dual program. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6368373 / rank | |||
Normal rank | |||
Revision as of 16:21, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions |
scientific article |
Statements
Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions (English)
0 references
11 November 2014
0 references
Summary: We consider a nonsmooth multiobjective programming problem where the functions involved are nondifferentiable. The class of univex functions is generalized to a far wider class of \((\varphi, \alpha, \rho, \sigma)\)-\(d_I\)-\(V\)-type I univex functions. Then, through various nontrivial examples, we illustrate that the class introduced is new and extends several known classes existing in the literature. Based upon these generalized functions, Karush-Kuhn-Tucker type sufficient optimality conditions are established. Further, we derive weak, strong, converse, and strict converse duality theorems for Mond-Weir type multiobjective dual program.
0 references
