Epsilon approximate solutions for multiobjective programming problems

DOI10.1006/jmaa.1996.0371zbMath0858.90114MaRDI QIDQ1815471

Kazunori Yokoyama

Publication date: 9 December 1996

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1996.0371

zbMATH Keywords

approximate solutions; multiobjective programming

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

Related Items

ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function, ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps, On approximating weakly/properly efficient solutions in multi-objective programming, Generating \(\varepsilon\)-efficient solutions in multiobjective programming, On approximate efficiency in multiobjective programming, \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems, Equivalent \(\varepsilon\)-efficiency notions in vector optimization, On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems, Approximate saddle points for constrained vector-valued games., Cone characterizations of approximate solutions in real vector optimization, Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems, A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, ε-approximate solutions in multiobjective optimization