On -quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
From MaRDI portal
(Redirected from On -quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data)
On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
Recommendations
- Weakly quasi -efficiency for semi-infinite multi-objective optimization problems with locally Lipschitzian data
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Multi-criteria optimization problems with fractional objectives: approximate optimality and approximate duality
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
Cites work
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- A class of nonsmooth fractional multiobjective optimization problems
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Approximate necessary optimality in fractional semi-infinite multiobjective optimization
- Approximate solutions of multiobjective optimization problems
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
- Formulae for the conjugate and the subdifferential of the supremum function
- scientific article; zbMATH DE number 7347486 (Why is no real title available?)
- scientific article; zbMATH DE number 7238249 (Why is no real title available?)
- scientific article; zbMATH DE number 5493307 (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
- Multi-criteria optimization problems with fractional objectives: approximate optimality and approximate duality
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Necessary conditions for ε-optimality
- New extremal principles with applications to stochastic and semi-infinite programming
- New Farkas-type constraint qualifications in convex infinite programming
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Nonsmooth semi-infinite multiobjective optimization problems
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- 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 of approximate solutions for nonsmooth semi-infinite programming problems
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- 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
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Subdifferential formulae for the supremum of an arbitrary family of functions
- Subdifferentials of marginal functions in semi-infinite programming
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Variational analysis and applications
Cited in
(3)- On isolated and proper efficiencies in fractional multiobjective optimization problems involving equality and inequality 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: On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126586)
