1. On the Structure of the Weakly Efficient Set for Quasiconvex Vector Minimization
- Author
-
Frank Plastria and Business technology and Operations
- Subjects
021103 operations research ,Control and Optimization ,Applied Mathematics ,0211 other engineering and technologies ,Regular polygon ,Structure (category theory) ,010103 numerical & computational mathematics ,02 engineering and technology ,Management Science and Operations Research ,Weakly efficient set ,01 natural sciences ,Combinatorics ,Set (abstract data type) ,Helly’s theorem ,Quasiconvex function ,Helly's theorem ,Bounded function ,Theory of computation ,Quasiconvex functions ,Minification ,0101 mathematics ,Multiobjective ,Linear enclosure ,Mathematics - Abstract
We investigate conditions under which the weakly efficient set for minimization of m objective functions on a closed and convex $$X\subset \mathbb R^d$$ ($$m>d$$) is fully determined by the weakly efficient sets for all n-objective subsets for some $$n
- Published
- 2019