Pages that link to "Item:Q1821701"
From MaRDI portal
The following pages link to Approximate saddle-point theorems in vector optimization (Q1821701):
Displayed 15 items.
- Optimality conditions for approximate solutions in multiobjective optimization problems (Q607984) (← links)
- On approximate efficiency in multiobjective programming (Q857826) (← links)
- Strict approximate duality in vector spaces (Q1115349) (← links)
- A saddle-point characterization of Pareto optima (Q1340067) (← links)
- On several concepts for \(\varepsilon\)-efficiency (Q1342424) (← links)
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization (Q2433240) (← links)
- Optimality conditions for metrically consistent approximate solutions in vector optimization (Q2471086) (← links)
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems (Q2494290) (← links)
- Saddle points and Pareto points in multiple objective programming (Q2569145) (← links)
- Two Types of Approximate Saddle Points (Q3514738) (← links)
- ε-approximate solutions in multiobjective optimization (Q4227987) (← links)
- A generalization of ekellandz’s variational principle (Q4327938) (← links)
- Approximate Saddle Point and Duality for Multiobjective <i>n</i>-Set Optimization (Q4435180) (← links)
- <b>ε</b>-Conjugate maps and<b>ε</b>-conjugate duality in vector optimization with set-valued maps (Q5505147) (← links)
- e-weak minimal solutions of vector optimization problems with set-valued maps (Q5925747) (← links)