Pages that link to "Item:Q1916781"
From MaRDI portal
The following pages link to \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function (Q1916781):
Displaying 31 items.
- Approximate solutions of multiobjective optimization problems (Q259809) (← links)
- 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)
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285) (← links)
- On approximate efficiency in multiobjective programming (Q857826) (← links)
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity (Q1304646) (← 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\)-optimality and duality for multiobjective fractional programming (Q1806494) (← links)
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems (Q1808441) (← links)
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space (Q1877027) (← 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)
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization (Q2150766) (← 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)
- Constrained \(\epsilon\)-vector valued games and generalized multi-valued \(\epsilon\)-minmax, \(\epsilon\)-maxmin programming. (Q2468603) (← links)
- Approximate saddle points for constrained vector-valued games. (Q2468641) (← links)
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems (Q2494290) (← links)
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems (Q2566120) (← links)
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION (Q2785241) (← links)
- On approximate starshapedness in multiobjective optimization (Q2815506) (← links)
- (Q3383228) (← links)
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS (Q3502868) (← links)
- Two Types of Approximate Saddle Points (Q3514738) (← links)
- Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (<i>F</i>, ρ)-convexity (Q4256096) (← links)
- Approximate Saddle Point and Duality for Multiobjective <i>n</i>-Set Optimization (Q4435180) (← links)
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function (Q5290835) (← links)
- <b>ε</b>-Conjugate maps and<b>ε</b>-conjugate duality in vector optimization with set-valued maps (Q5505147) (← links)