Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization

From MaRDI portal
Revision as of 16:20, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:868542

DOI10.1007/s10957-006-9098-4zbMath1145.90062OpenAlexW2003584206MaRDI QIDQ868542

Fabián Flores-Bazan, Cristián Vera

Publication date: 6 March 2007

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-006-9098-4




Related Items (18)

Set-valued optimization in variable preference structures with new variants of generalized convexityConditions for solutions, their globality, and their duality relations in vector optimization with relaxed quasiconvexityBoundedness and nonemptiness of the efficient solution sets in multiobjective optimizationOptimality conditions for a unified vector optimization problem with not necessarily preordering relationsOn the existence of weak efficient solutions of nonconvex vector optimization problemsVectorial penalisation in vector optimisation in real linear-topological spacesSome saddle-point theorems for vector-valued functionsExistence of optimal points via improvement setsCharacterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problemsExistence and boundedness of solutions in infinite-dimensional vector optimization problemsNonemptiness and boundedness of solution sets for vector variational inequalities via topological methodOn the set of weakly efficient minimizers for convex multiobjective programmingUnifying local-global type properties in vector optimizationInner and outer estimates for the solution sets and their asymptotic cones in vector optimizationBoundedness and nonemptiness of solution sets for set-valued vector equilibrium problems with an applicationAn optimal alternative theorem and applications to mathematical programmingWeak efficiency in multiobjective quasiconvex optimization on the real-line without derivativesOn the structure of the weakly efficient set for quasiconvex vector minimization



Cites Work


This page was built for publication: Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization