-optimality criteria for vector minimization problems via exact penalty functions
From MaRDI portal
(Redirected from Publication:1340552)
\(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
\(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
Recommendations
Cited in
(12)- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- -optimality and duality for multiobjective fractional programming
- Approximate saddle points for constrained vector-valued games.
- Sequential optimality conditions for multiobjective fractional programming problems
- An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
- scientific article; zbMATH DE number 5992448 (Why is no real title available?)
- Necessary conditions for εe-minimizers in vector optimization with empty interior ordering sets
- ε-approximate solutions in multiobjective optimization
- scientific article; zbMATH DE number 714165 (Why is no real title available?)
- An approximate exact penalty in constrained vector optimization on metric spaces
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
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)