-optimality criteria for vector minimization problems via exact penalty functions
From MaRDI portal
Publication:1340552
DOI10.1006/JMAA.1994.1357zbMATH Open0816.90117OpenAlexW1998071018MaRDI QIDQ1340552FDOQ1340552
Authors: 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
Recommendations
Cited In (12)
- Title not available (Why is that?)
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
- ε-approximate solutions in multiobjective optimization
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
- Approximate saddle points for constrained vector-valued games.
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- Sequential optimality conditions for multiobjective fractional programming problems
- Title not available (Why is that?)
- An approximate exact penalty in constrained vector optimization on metric spaces
- Necessary conditions for εe-minimizers in vector optimization with empty interior ordering sets
This page was built for publication: \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340552)
