Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
From MaRDI portal
Publication:1787821
DOI10.1007/s40995-017-0156-6zbMath1397.90383OpenAlexW2607615611MaRDI QIDQ1787821
Publication date: 5 October 2018
Published in: Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40995-017-0156-6
multi-objective optimizationoptimality conditionssemi-infinite programmingClarke subdifferentialconstraint qualification
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (10)
On stationarity for nonsmooth multiobjective problems with vanishing constraints ⋮ Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ Optimality and duality for \(E\)-differentiable multiobjective programming problems involving \(E\)-type I functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification ⋮ Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Sufficiency in nonsmooth multiobjective programming involving generalized \(( F, \rho\) )-convexity
- Semi-infinite programming
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- On efficiency and duality for multiobjective programs
- Invex functions and generalized convexity in multiobjective programming
- Regularity conditions in vector optimization
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- First and second-order optimality conditions for convex composite multiobjective optimization
- Dual conditions characterizing optimality for convex multi-objective programs.
- Generalized \((F,\rho )\)-convexity and duality in nonsmooth problems of multiobjective optimization
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Nonsmooth semi-infinite multiobjective optimization problems
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions
- Infine functions and nonsmooth multiobjective optimization problems
- Nonsmooth semi-infinite programming problems with mixed constraints
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Optimality conditions for non-smooth semi-infinite programming
- Strong and Weak Convexity of Sets and Functions
- Semi-Infinite Programming: Theory, Methods, and Applications
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
- Multiobjective Problems with Nonsmooth Equality Constraints
- Optimization and nonsmooth analysis
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Convex Analysis
- Multiobjective programming under generalized type I invexity
This page was built for publication: Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
