\(\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)
Multi-objective and goal programming (90C29) Fréchet and Gateaux differentiability in optimization (49J50)
Related Items (23)
ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ A combined scalarizing method for multiobjective programming problems ⋮ On approximate efficiency in multiobjective programming ⋮ On approximate solutions in vector optimization problems via scalarization ⋮ Approximations for Pareto and proper Pareto solutions and their KKT conditions ⋮ Improving the min-max method for multiobjective programming ⋮ Optimality conditions for approximate solutions in multiobjective optimization problems ⋮ Characterizing ϵ-properly efficient solutions ⋮ A note on approximate proper efficiency in linear fractional vector optimization ⋮ Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Equivalent \(\varepsilon\)-efficiency notions in vector optimization ⋮ Unnamed Item ⋮ On a practical notion of Geoffrion proper optimality in multicriteria optimization ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps ⋮ Approximate proper efficiency in vector optimization ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ E-Benson proper efficiency in vector optimization ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
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
This page was built for publication: \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
