Pages that link to "Item:Q1815471"
From MaRDI portal
The following pages link to Epsilon approximate solutions for multiobjective programming problems (Q1815471):
Displaying 25 items.
- On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity (Q279827) (← links)
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
- On approximating weakly/properly efficient solutions in multi-objective programming (Q410073) (← links)
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285) (← links)
- On approximate efficiency in multiobjective programming (Q857826) (← links)
- Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency (Q1626531) (← links)
- On approximate solutions for robust convex semidefinite optimization problems (Q1670443) (← links)
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems (Q1808441) (← links)
- Equivalent \(\varepsilon\)-efficiency notions in vector optimization (Q1939080) (← links)
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems (Q1952121) (← links)
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
- On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
- Approximate saddle points for constrained vector-valued games. (Q2468641) (← links)
- Cone characterizations of approximate solutions in real vector optimization (Q2471114) (← links)
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems (Q2494290) (← links)
- Sequential optimality conditions for multiobjective fractional programming problems (Q2512875) (← links)
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems (Q2566120) (← links)
- On approximate starshapedness in multiobjective optimization (Q2815506) (← links)
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization (Q2841152) (← links)
- Characterizing ϵ-properly efficient solutions (Q2943836) (← links)
- (Q3383228) (← links)
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems (Q5244131) (← links)
