Near-Subconvexlikeness in Vector Optimization with Set-Valued Functions

X. M. Yang, D. Li and S. Y. Wang

Journal of Optimization Theory and Applications, 2001, vol. 110, issue 2, No 9, 413-427

Abstract: Abstract A new class of generalized convex set-valued functions, termed nearly-subconvexlike functions, is introduced. This class is a generalization of cone-subconvexlike maps, nearly-convexlike set-valued functions, and preinvex set-valued functions. Properties for the nearly-subconvexlike functions are derived and a theorem of the alternative is proved. A Lagrangian multiplier theorem is established and two scalarization theorems are obtained for vector optimization.

Keywords: Set-valued functions; vector optimization; nearly-subconvexlike functions; theorems of the alternative; scalarization; Lagrangian multiplier theorem (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://link.springer.com/10.1023/A:1017535631418 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:110:y:2001:i:2:d:10.1023_a:1017535631418

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1017535631418

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().