scientific article

zbMath1058.90072MaRDI QIDQ2718685

No author found.

Publication date: 4 June 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53)

Related Items (24)

Semivectorial bilevel optimization problem: penalty approach ⋮ Approximate proximal methods in vector optimization ⋮ On the existence and stability of approximate solutions of perturbed vector equilibrium problems ⋮ Complete characterizations of robust strong duality for robust vector optimization problems ⋮ On approximate efficiency in multiobjective programming ⋮ Optimality conditions for approximate solutions in multiobjective optimization problems ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ A generic approach to approximate efficiency and applications to vector optimization with set-valued maps ⋮ Existence and optimality conditions for approximate solutions to vector optimization problems ⋮ An interior proximal method in vector optimization ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency ⋮ Improvement sets and vector optimization ⋮ Duality for robust linear infinite programming problems revisited ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Stability of minimality and criticality in directional set-valued optimization problems ⋮ Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ A new approach to strong duality for composite vector optimization problems ⋮ Extragradient method with Bregman distances for solving vector quasi-equilibrium problems ⋮ Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems ⋮ (\(\epsilon\)-)efficiency in difference vector optimization ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems

This page was built for publication: