Epsilon approximate solutions for multiobjective programming problems
From MaRDI portal
(Redirected from Publication:1815471)
Recommendations
Cited in
(33)- scientific article; zbMATH DE number 7399394 (Why is no real title available?)
- On -solutions for robust fractional optimization problems
- On -solutions for convex optimization problems with uncertainty data
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- ε-approximate solutions in multiobjective optimization
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
- On approximate starshapedness in multiobjective optimization
- Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
- Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency
- Equivalent \(\varepsilon\)-efficiency notions in vector optimization
- On approximate solutions for robust convex semidefinite optimization problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- Approximate saddle points for constrained vector-valued games.
- Hybrid \((\Phi ,\Psi ,\rho ,\zeta ,\theta)\)-invexity frameworks and efficiency conditions for multiobjective fractional programming problems
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Characterizing ϵ-properly efficient solutions
- On approximate efficiency in multiobjective programming
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Cone characterizations of approximate solutions in real vector optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- Sequential optimality conditions for multiobjective fractional programming problems
- On approximate efficiency for nonsmooth robust vector optimization problems
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Higher order hybrid invexity frameworks and discrete multiobjective fractional programming problems
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
This page was built for publication: Epsilon approximate solutions for multiobjective programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815471)
