Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions
type: Item
instance of: scholarly article
title: Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions
zbMATH Open document ID: 1298.90096
DOI: 10.1155/2014/904640
author: Pallavi Kharbanda
author: Divya Agarwal
author: Deepa Sinha
published in: ISRN Applied Mathematics
publication date: 2014-11-11T00:00:00Z
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.
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6368373
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/904640
OpenAlex ID: W2155359095
Wikidata QID: Q59049787
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Strong and Weak Convexity of Sets and Functions
cites work: Necessary and sufficient conditions in constrained optimization
cites work: On generalised convex mathematical programming
cites work: Multiobjective programming under generalized type I invexity
cites work: Optimality conditions and duality for a class of nonlinear fractional programming problems.
cites work: Sufficiency and duality in multiobjective programming under generalized type I functions
cites work: \(D\)-invexity and optimality conditions
cites work: Multiobjective programming under \(d\)-invexity
cites work: Some nondifferentiable multiobjective programming problems
cites work: \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization
cites work: Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
cites work: Q4296818
cites work: Optimality and duality with generalized convexity
cites work: On multiple-objective optimization with generalized univexity
cites work: Nondifferentiable multiobjective programming under generalized \(d\)-univexity
cites work: Nonsmooth multiobjective optimization involving generalized univex functions
cites work: Optimality and duality in nondifferentiable multiobjective optimization involving \(d\)-type I and related functions
cites work: Pre-invex functions in multiple objective optimization
cites work: A class of nonconvex functions and mathematical programming
cites work: Q4764692
cites work: Optimization and nonsmooth analysis
description: scientific article; zbMATH DE number 6368373