Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
DOI10.1007/s13160-024-00679-xMaRDI QIDQ6671901
Publication date: 27 January 2025
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
generalized convexityconstraint qualificationMordukhovich/limiting subdifferential\(\varepsilon\)-quasi duality theorem\(\varepsilon\)-quasi optimality condition\(\varepsilon\)-quasi saddle point theorem
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
This page was built for publication: Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
