Pages that link to "Item:Q2494290"
From MaRDI portal
The following pages link to Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems (Q2494290):
Displayed 9 items.
- On approximate efficiency in multiobjective programming (Q857826) (← links)
- On approximate solutions in vector optimization problems via scalarization (Q861514) (← links)
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems (Q1044130) (← links)
- Optimality conditions for metrically consistent approximate solutions in vector optimization (Q2471086) (← links)
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems (Q2566120) (← links)
- Two Types of Approximate Saddle Points (Q3514738) (← 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)