\(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions

DOI10.1006/jmaa.1994.1357zbMath0816.90117OpenAlexW1998071018MaRDI QIDQ1340552

Kazunori Yokoyama

Publication date: 2 July 1995

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

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

zbMATH Keywords

exact penalty functionvector minimization\(\varepsilon\)-approximate optimal solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (6)

APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ Approximate saddle points for constrained vector-valued games. ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ \(\varepsilon\)-optimality and duality for multiobjective fractional programming ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ ε-approximate solutions in multiobjective optimization

This page was built for publication: \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions