Approximate solutions for robust multiobjective optimization programming in Asplund spaces

In this paper, we study a nonsmooth/nonconvex multiobjective optimization problem with uncertain constraints in arbitrary Asplund spaces. We first provide necessary optimality condition fuzzy form for approximate weakly robust efficient solutions and then establish theorem quasi-efficient of the sense limiting subdifferential by exploiting terms Fréchet subdifferential. Sufficient conditions (weakly) to such are also driven under new concept generalized pseudo convex functions. Finally, address an Mond-Weir-type dual reference explore weak, strong, converse duality properties assumptions convexity.