Epsilon approximate solutions for multiobjective programming problems
From MaRDI portal
Publication:1815471
DOI10.1006/jmaa.1996.0371zbMath0858.90114OpenAlexW2042783907MaRDI QIDQ1815471
Publication date: 9 December 1996
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1996.0371
Related Items (31)
On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ On Minty variational principle for nonsmooth vector optimization problems with approximate convexity ⋮ Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ Higher Order Hybrid Invexity Frameworks and Discrete Multiobjective Fractional Programming Problems ⋮ Hybrid (Φ,Ψ, ρ, ζ, θ)−invexity frameworks and efficiency conditions for multiobjective fractional programming problems ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ On approximate efficiency in multiobjective programming ⋮ On approximate solutions for robust convex semidefinite optimization problems ⋮ Characterizing ϵ-properly efficient solutions ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Equivalent \(\varepsilon\)-efficiency notions in vector optimization ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ Unnamed Item ⋮ Approximate saddle points for constrained vector-valued games. ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems ⋮ On approximate starshapedness in multiobjective optimization ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization ⋮ ε-approximate solutions in multiobjective optimization ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems
This page was built for publication: Epsilon approximate solutions for multiobjective programming problems
