Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization

Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Set-valued maps in general topology (54C60)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Multicriteria Optimization
Connectedness of the solution sets and scalarization for vector equilibrium problems
Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
A Frank--Wolfe type theorem for convex polynomial programs
Connectedness of the efficient point sets in quasiconcave vector maximization
Polynomial vector variational inequalities under polynomial constraints and applications
Monotone affine vector variational inequalities
Connectedness structure of the solution sets of vector variational inequalities
On the parametric affine variational inequality approach to linear fractional vector optimization problems
Unbounded components in the solution sets of strictly quasiconcave vector maximization problems
Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
Images of connected sets by semicontinuous multifunctions
Connectedness of the set of nondominated outcomes in multicriteria optimization
Generalized Concavity
Numbers of the connected components of the solution sets of monotone affine vector variational inequalities
Vector Variational Inequalities and Vector Optimization
On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems
Existence and connectedness of solutions for generalized vector quasi-equilibrium problems
Connectedness of the approximate solution sets for set optimization problems
Connectedness of the solution sets in generalized semi-infinite set optimization
Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems
On the numbers of connected components in the solution sets of polynomial vector variational inequalities
An Application of the Tarski-Seidenberg Theorem with Quantifiers to Vector Variational Inequalities
Disconnectedness and unboundedness of the solution sets of monotone vector variational inequalities

This page was built for publication: Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667712)