Characterizations of efficiency in vector optimization with C(T)-valued mappings

In this paper, under the assumption of pseudoconvexity, we present some characterizations of efficient solutions and weak efficient solutions for vector optimization problems with C ( T ) -valued mappings by means of Clarke derivatives and subdifferentials. Our main results generalize the correspond...

Full description

Saved in:
Bibliographic Details
Published inOptimization letters Vol. 9; no. 2; pp. 391 - 401
Main Authors Zhao, Ke Quan, Yang, Xin Min
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2015
Subjects
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
valued mappings
Efficiency
Pseudoconvexity
Vector optimization with
Clarke derivatives and subdifferentials
Online AccessGet full text

Cover

More Information
Summary:In this paper, under the assumption of pseudoconvexity, we present some characterizations of efficient solutions and weak efficient solutions for vector optimization problems with C ( T ) -valued mappings by means of Clarke derivatives and subdifferentials. Our main results generalize the corresponding results in Winkler (SIAM J. Optim. 19:756–765, 2008 ) to nonconvex case.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-014-0753-7