SVOP

AcronymDefinition
SVOPSaccadic Vector Optokinetic Perimetry (vision)
SVOPSales Value of Production
SVOPSave Opportunity (baseball)
SVOPSouth-Verona Outcome Project (mental health study; Italy)
SVOPSystem for Venous Occlusion Plethysmography (US NASA)
References in periodicals archive ?
One of our main aims in this work is to investigate the structure of the (weak) Pareto solution set and the (weak) Pareto optimal set of (SVOP) whose graph Gr(F) is the union of finitely many G-polyhedra.
Zheng [13] proved that the Pareto set S and the Pareto optimal value set V of (SVOP) are pathwise connected, respectively, when the ordering cone C is a pointed, closed, convex cone with a weakly compact base and F is a C-convex multifunction whose graph is the union of finitely many convex polyhedra.
The other of our main aims is to study the connectedness of the Pareto set S and the Pareto optimal value set V of (SVOP) without the assumption of the ordering cone C having a weakly compact base but with that of the cone C being polyhedral.
In this paper, we will consider set-valued vector optimization problem (SVOP).
We say that [bar.x] [member of] [GAMMA] is a Pareto (resp., weak Pareto or positively proper Pareto) solution of (SVOP), if there exists [bar.y] [member of] F([bar.x]) such that [bar.y] [member of] E(F(r),C) (resp., [bar.y] [member of] WE(F(r),C) or [bar.y] [member of] Pos(F([GAMMA]),C)); in this case, we say that [bar.y] is a Pareto (resp., weak Pareto or positively proper Pareto) optimal value of (SVOP).
In view of Lemma 7, it is practical to investigate some topics on (SVOP) in a finite dimensional framework.
In this section, our aim is to investigate the structure of the (weak) Pareto solution set and the (weak) Pareto optimal set of (SVOP) whose graph Gr(F) is the union of finitely many G-polyhedra.
Without the convexity of A + C in Lemma 14, we have the following lemma which will also be applied to consider (SVOP).
In this section, dropping the assumption that the ordering cone C has a weakly compact base but requiring that C is pointed and polyhedral, under the C-convexity assumption on the set-valued objective mapping F, we will establish connectedness of Pareto solution set S and Pareto optimal value set V of (SVOP).