On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data

DOI10.1007/s11117-024-01046-3OpenAlexW4393392510MaRDI QIDQ6126586

Publication date: 9 April 2024

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-024-01046-3

zbMATH Keywords

generalized convexity constraint qualification infinite optimization approximate optimality condition approximate duality theorem Mordukhovich/limiting subdifferential

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)

Cites Work

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
A class of nonsmooth fractional multiobjective optimization problems
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
Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
Formulae for the conjugate and the subdifferential of the supremum function
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
On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
New extremal principles with applications to stochastic and semi-infinite 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
On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
Subdifferentials of Marginal Functions in Semi-infinite Programming
Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
Necessary conditions for ε-optimality
Variational Analysis and Applications
Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential
Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials
Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions
On approximate solutions for nonsmooth robust multiobjective optimization problems
Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
New Farkas-type constraint qualifications in convex infinite programming
Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming

This page was built for publication: On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data