e-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints

Using a scalarization method, approximate optimality conditions of a multiobjective nonconvex optimization problem which has an infinite number of constraints are established. Approximate duality theorems for mixed duality are given. Results on approximate duality in Wolfe type and Mond-Weir type are also derived. Approximate saddle point theorems of an approximate vector Lagrangian function are investigated. Keywords Almost quasi [epsilon]-Pareto solution * Quasi [epsilon]-Pareto saddle point * [epsilon]-Vector Lagrangian Mathematics Subject Classification 90C26 * 49N15 * 90C46