-optimality criteria for vector minimization problems via exact penalty functions

DOI10.1006/JMAA.1994.1357MaRDI QIDQ1340552zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(\varepsilon\)-approximate optimal solutionsexact penalty functionvector minimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Review text

This paper is concerned with a vector minimization problem and the corresponding \(\varepsilon\)-approximate optimal solutions. The problem is transformed into an unconstrained problem by using an exact penalty function. Consequently optimality criteria are derived by estimating the size of the penalty parameter in terms of \(\varepsilon\)-approximate solutions of the dual problems.

Recommendations

• \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
• An approximate exact penalty in constrained vector optimization on metric spaces
• An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems

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)