A note on characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators

Abstract

This note concerns with Theorem 4.1 in [Kabgani A, Soleimani-damaneh M. Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators. Optimization, 2018; 67: 217–235]. We present this theorem in a correct way and show that the error does not influence other results of the paper. Moreover, we provide some new corollaries for this theorem.

Keywords:

• Nonsmooth optimization
• multiobjective optimization
• convexificator
• semi-infinite programming
• constraint qualification

AMS CLASSIFICATIONS:

• 49J52
• 90C26
• 90C46

Disclosure statement

No potential conflict of interest was reported by the authors.