Explicitly quasiconvex set-valued optimization
The paper begins with some general definitions and preliminary results concerning cone-convex and cone-quasiconvex set-valued maps with values in a real linear space, partially ordered by a relatively solid convex cone. Then, the author introduces the notion of explicitly cone-quasiconvex set-valued map. Characterization of this notions and the relationship between this notion and the usual notions of cone-convexity and cone-quasiconvexity are studied. Finally, by restricting the attention on set-valued maps with values in a finite dimensional Euclidean space, partially ordered by the standard ordering cone, the paper derives from the main result sufficient conditions for the Pareto reducibility, as well as for the contractibility of the efficient outcome set.
- A characterization of quasiconvex vector-valued functions
- A solvability theorem for a class of quasiconvex mappings with applications to optimization
- Abstract convexity and global optimization
- Connectedness of the efficient set for three-objective quasiconcave maximization problems
- Connectedness of the efficient set of strictly quasiconcave sets
- Contractibility of efficient frontier of simply shaded sets
- Contractibility of the efficient frontier of three-dimensional simply-shaded sets.
- Contractibility of the solution sets in strictly quasiconcave vector maximization on noncompact domains
- Convexity for set-valued maps
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 3936960 (Why is no real title available?)
- scientific article; zbMATH DE number 824551 (Why is no real title available?)
- scientific article; zbMATH DE number 3307201 (Why is no real title available?)
- Images of connected sets by semicontinuous multifunctions
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- On Efficient Solutions to Multiple Objective Mathematical Programs
- On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
- On three concepts of quasiconvexity in vector optimization
- Pareto reducible multicriteria optimization problems
- Set-valued analysis
- The structure of the efficient frontier of finite-dimensional completely-shaded sets
- Topological Properties of the Efficient Point Set
- Variational methods in partially ordered spaces
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- Unifying local-global type properties in vector optimization
- Continuity of cone-convex functions
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization
- Scalar characterizations of weakly cone-convex and weakly cone-quasiconvex functions
- New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
- Almost explicitly quasiconvex bicriteria optimization
- On the intrinsic core of convex cones in real linear spaces
- A special class of extended multicriteria location problems
- Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
- Vectorial penalisation in vector optimisation in real linear-topological spaces
- Characterizations of proper cone quasiconvexity and cone semicontinuity via nonlinear scalarization functions for vector-valued maps
- A new concept of semistrict quasiconvexity for vector functions
- Some characterizations of ideal points in vector optimization problems
- Arcwise cone-quasiconvex multicriteria optimization
This page was built for publication: Explicitly quasiconvex set-valued optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460113)
