Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints

DOI10.1007/S13160-024-00679-XMaRDI QIDQ6671901zbMATH OpenFDO

Authors Thanh-Hung Pham

Publication date 27 January 2025

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13160-024-00679-X

zbMATH Keywords

\(\varepsilon\)-quasi duality theorem\(\varepsilon\)-quasi optimality condition\(\varepsilon\)-quasi saddle point theoremconstraint qualificationgeneralized convexityMordukhovich/limiting subdifferential

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Semi-infinite programming (90C34) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)

Recommendations

• Approximate optimal solutions for multiobjective optimization problems with infinite constraints
• On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
• Approximate proper efficiencies in nonsmooth semi-infinite multiobjective optimization problems
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems

Cites work

• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
• Approximate optimal solutions for multiobjective optimization problems with infinite constraints
• Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
• Approximate proper efficiencies in nonsmooth semi-infinite multiobjective optimization problems
• Approximate solutions of multiobjective optimization problems
• Characterizations of the solution set for nonconvex semi-infinite programming problems
• Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
• Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
• Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
• scientific article; zbMATH DE number 7347486 (Why is no real title available?)
• Isolated and proper efficiencies in semi-infinite vector optimization problems
• Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
• Necessary and sufficient optimality conditions in DC semi-infinite programming
• Nonsmooth semi-infinite multiobjective optimization problems
• On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
• On approximate solutions for nonsmooth robust multiobjective optimization problems
• On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
• On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
• On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
• On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
• Optimality conditions for nonsmooth semi-infinite multiobjective programming
• Optimality conditions for semi-infinite programming problems under relaxed quasiconvexity assumptions
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
• Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
• Some characterizations of approximate solutions for robust semi-infinite optimization problems
• Stable Farkas lemmas and duality for nonconvex composite semi-infinite programming problems
• Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
• Strong Karush-Kuhn-Tucker optimality conditions for multiobjective semi-infinite programming
• Variational analysis and applications

Cited in

(5)

• On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
• Approximate proper efficiencies in nonsmooth semi-infinite multiobjective optimization problems
• Approximate optimal solutions for multiobjective optimization problems with infinite constraints
• On Chankong-Haimes scheme for approximate optimality conditions of nonsmooth fractional multiobjective optimization problems with infinite constraints
• On efficient solutions of nonsmooth fractional multiobjective optimization problems with mixed constraints

This page was built for publication: Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671901)