Optimality conditions for a unified vector optimization problem with not necessarily preordering relations

From MaRDI portal
Publication:2392756


DOI10.1007/s10898-011-9822-yzbMath1291.90285MaRDI QIDQ2392756

Elvira Hernández, Fabián Flores-Bazan

Publication date: 2 August 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/128149


90C39: Dynamic programming


Related Items

Set optimization using improvement sets, Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis, Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line, Extended radial epiderivatives of non-convex vector-valued maps and parametric quasiconvex programming, Scalarization and well-posedness for set optimization using coradiant sets, Some saddle-point theorems for vector-valued functions, Stability and scalarization in vector optimization using improvement sets, Existence of optimal points via improvement sets, A kind of unified proper efficiency in vector optimization, Unifying local-global type properties in vector optimization, Vector optimization using improvement sets in locally convex spaces, Characterizations of efficient and weakly efficient points in nonconvex vector optimization, Second-order optimality conditions for set optimization using coradiant sets, Improvement sets and vector optimization, Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior, Existence and characterization theorems in nonconvex vector optimization, Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization, Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems, Stability in unified semi-infinite vector optimization, First and second order optimality conditions in vector optimization problems with nontransitive preference relation, A Survey of Set Optimization Problems with Set Solutions



Cites Work