On Quasiconvex Multiobjective Optimization and Variational Inequalities Using Greenberg–Pierskalla Based Generalized Subdifferentials

In this paper, we first characterize generalized convex functions introduced by Linh and Penot Optimization (62: 943–959, 2013) by using generalized monotonicity of the generalized subdifferentials. We use vector variational inequalities in terms of generalized subdifferentials to identify efficient solutions of a multiobjective optimization problem involving quasiconvex functions. We also establish the Minty variational principle by utilizing the mean value theorem established by Kabgani and Soleimani-damaneh (Numer. Funct. Anal. Optim 38: 1548–1563, 2017) for quasiconvex functions in terms of Greenberg–Pierskalla subdifferentials.