\(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems

From MaRDI portal
Revision as of 10:19, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1808441


DOI10.1016/S0893-9659(99)00087-7zbMath0944.90081MaRDI QIDQ1808441

Jen-chwan Liu

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

Unnamed Item, Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization, Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization, On a practical notion of Geoffrion proper optimality in multicriteria optimization, 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, \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps, 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, Approximations for Pareto and proper Pareto solutions and their KKT conditions, 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, Improving the min-max method for multiobjective programming, A note on approximate proper efficiency in linear fractional vector optimization, 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