Open Access
February, 2021 Vector Critical Points and Cone Efficiency in Nonsmooth Vector Optimization
Tadeusz Antczak, Marcin Studniarski
Taiwanese J. Math. 25(1): 183-206 (February, 2021). DOI: 10.11650/tjm/200701

Abstract

In this paper, a nonsmooth vector optimization problem with cone and equality constraints is considered. We establish some relations between the notions of vector critical points in the sense of Fritz John and in the sense of Karush-Kuhn-Tucker and weakly $K$-efficient and $K$-efficient solutions for the constrained vector optimization problem in which every component of the involved functions is locally Lipschitz. These relationships are stated under cone-$FJ$-pseudo-invexity and cone-$KT$-pseudo-invexity hypotheses defined for the considered vector optimization problem with cone inequality and also equality constraints and via the Clarke generalized gradient for vector-valued functions.

Citation

Download Citation

Tadeusz Antczak. Marcin Studniarski. "Vector Critical Points and Cone Efficiency in Nonsmooth Vector Optimization." Taiwanese J. Math. 25 (1) 183 - 206, February, 2021. https://doi.org/10.11650/tjm/200701

Information

Received: 28 March 2019; Revised: 5 March 2020; Accepted: 8 July 2020; Published: February, 2021
First available in Project Euclid: 11 August 2020

Digital Object Identifier: 10.11650/tjm/200701

Subjects:
Primary: 49J52 , 90C26 , 90C29 , 90C46

Keywords: (weakly) efficiency , nonsmooth cone-$FJ$-pseudo-invexity , nonsmooth cone-$KT$-pseudo-invexity , nonsmooth mutiobjective programming , optimality conditions , vector critical point

Rights: Copyright © 2021 The Mathematical Society of the Republic of China

Vol.25 • No. 1 • February, 2021
Back to Top