Approximate optimal solutions for multiobjective optimization problems with infinite constraints

DOI10.1007/s40840-024-01666-8OpenAlexW4392377105MaRDI QIDQ6196813

Publication date: 15 March 2024

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-024-01666-8

zbMATH Keywords

generalized convexity constraint qualification approximate optimality condition approximate duality theorem Mordukhovich/limiting subdifferential approximate saddle point theorem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Optimality conditions for problems in abstract spaces (49K27)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Approximate solutions of multiobjective optimization problems
\(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
Isolated and proper efficiencies in semi-infinite vector optimization problems
On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
On robust duality for fractional programming with uncertainty data
Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
\(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
\(\epsilon\)-solutions in vector minimization problems
Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
Nondifferentiable fractional semi-infinite multiobjective optimization problems
An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
Nonsmooth semi-infinite multiobjective optimization problems
Optimality conditions for nonsmooth semi-infinite multiobjective programming
Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
Some characterizations of approximate solutions for robust semi-infinite 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
Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
OPTIMALITY CONDITIONS AND DUALITY IN FRACTIONAL ROBUST OPTIMIZATION PROBLEMS
Necessary conditions for ε-optimality
Variational Analysis and Applications
Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential
Parametric approach for approximate efficiency of robust multiobjective fractional programming problems
Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials
On approximate solutions for nonsmooth robust multiobjective optimization problems
Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
Multicriteria Optimization
On Nonlinear Fractional Programming
Duality for nonlinear fractional programs
ON OPTIMALITY AND DUALITY FOR GENERALIZED FRACTIONAL ROBUST OPTIMIZATION PROBLEMS
Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data

This page was built for publication: Approximate optimal solutions for multiobjective optimization problems with infinite constraints