Journal
OPTIMIZATION
Volume 67, Issue 2, Pages 217-235Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2017.1393675
Keywords
Nonsmooth optimization; multiobjective optimization; convexificator; semi-infinite programming; constraint qualification
Funding
- Center for International Scientific Studies and Collaboration (CISSC)
Ask authors/readers for more resources
The main aim of this paper is to investigate weakly/properly/robust efficient solutions of a nonsmooth semi-infinite multiobjective programming problem, in terms of convexificators. In some of the results, we assume the feasible set to be locally star-shaped. The appearing functions are not necessarily smooth/locally Lipschitz/convex. First, constraint qualifications and the normal cone to the feasible set are studied. Then, as a major part of the paper, various necessary and sufficient optimality conditions for solutions of the problem under consideration are presented. The paper is closed by a linear approximation problem to detect the solutions and by studying a gap function.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available