\(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
From MaRDI portal
Publication:1808441
DOI10.1016/S0893-9659(99)00087-7zbMath0944.90081MaRDI QIDQ1808441
Publication date: 26 September 2000
Published in: Applied Mathematics Letters (Search for Journal in Brave)
90C29: Multi-objective and goal programming
49J50: Fréchet and Gateaux differentiability in optimization
Related Items
E-Benson proper efficiency in vector optimization, ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function, ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps, A combined scalarizing method for multiobjective programming problems, On approximating weakly/properly efficient solutions in multi-objective programming, Optimality conditions for approximate solutions in multiobjective optimization problems, On approximate efficiency in multiobjective programming, On approximate solutions in vector optimization problems via scalarization, Equivalent \(\varepsilon\)-efficiency notions in vector optimization, Optimality conditions for metrically consistent approximate solutions in vector optimization, A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems, Approximate proper efficiency in vector optimization, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, Characterizing ϵ-properly efficient solutions
Cites Work
- Epsilon approximate solutions for multiobjective programming problems
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- Proper efficiency and the theory of vector maximization
- Systems of Inequalities Involving Convex Functions
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
