Kolmogorov conditions for vectorial optimization problems
From MaRDI portal
Cites work
Cited in
(8)- εVariational inequalities for vector approximation problems
- Sufficient optimality conditions involving the Krotov vector function. I
- Sufficient optimality conditions involving the Krotov vector function. II
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
- Optimality conditions for the difference of convex set-valued mappings
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Sufficient optimality conditions for a bilevel semivectorial D.C. problem
This page was built for publication: Kolmogorov conditions for vectorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908035)