Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization

In this paper, generalized higher-order contingent (adjacent) derivatives of set-valued maps are introduced and some of their properties are discussed. Under no any convexity assumptions, necessary and sufficient optimality conditions are obtained for weakly efficient solutions of set-valued optimiz...

Full description

Bibliographic Details
Main Authors: Wang, L., Li, S., Teo, Kok Lay
Format: Journal Article
Published: Springer Verlag 2010
Subjects:
Online Access:http://hdl.handle.net/20.500.11937/23999
_version_ 1848751307242864640
author Wang, L.
Li, S.
Teo, Kok Lay
author_facet Wang, L.
Li, S.
Teo, Kok Lay
author_sort Wang, L.
building Curtin Institutional Repository
collection Online Access
description In this paper, generalized higher-order contingent (adjacent) derivatives of set-valued maps are introduced and some of their properties are discussed. Under no any convexity assumptions, necessary and sufficient optimality conditions are obtained for weakly efficient solutions of set-valued optimization problems by employing the generalized higher-order derivatives.
first_indexed 2025-11-14T07:50:39Z
format Journal Article
id curtin-20.500.11937-23999
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T07:50:39Z
publishDate 2010
publisher Springer Verlag
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-239992017-09-13T16:00:11Z Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization Wang, L. Li, S. Teo, Kok Lay Nonconvex set-valued optimization - Generalized higher-order contingent (adjacent) derivatives - Gerstewitz’s nonconvex separation functional - Weakly efficient solutions - Higher-order optimality conditions In this paper, generalized higher-order contingent (adjacent) derivatives of set-valued maps are introduced and some of their properties are discussed. Under no any convexity assumptions, necessary and sufficient optimality conditions are obtained for weakly efficient solutions of set-valued optimization problems by employing the generalized higher-order derivatives. 2010 Journal Article http://hdl.handle.net/20.500.11937/23999 10.1007/s11590-009-0170-5 Springer Verlag restricted
spellingShingle Nonconvex set-valued optimization - Generalized higher-order contingent (adjacent) derivatives - Gerstewitz’s nonconvex separation functional - Weakly efficient solutions - Higher-order optimality conditions
Wang, L.
Li, S.
Teo, Kok Lay
Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
title Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
title_full Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
title_fullStr Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
title_full_unstemmed Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
title_short Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
title_sort higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
topic Nonconvex set-valued optimization - Generalized higher-order contingent (adjacent) derivatives - Gerstewitz’s nonconvex separation functional - Weakly efficient solutions - Higher-order optimality conditions
url http://hdl.handle.net/20.500.11937/23999