In this paper, we establish necessary and sufficient conditions to characterize weakly efficient solutions in nonsmooth quasiconvex multiobjective programming. The results are proved in terms of the Greenberg–Pierskalla, Penot, Plastria,… Click to show full abstract
In this paper, we establish necessary and sufficient conditions to characterize weakly efficient solutions in nonsmooth quasiconvex multiobjective programming. The results are proved in terms of the Greenberg–Pierskalla, Penot, Plastria, Gutiérrez and Suzuki–Kuroiwa subdifferentials. The established results can be used to provide powerful tools for sketching numerical algorithms and deriving duality results.
               
Click one of the above tabs to view related content.