Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces (Q705084): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:57, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces |
scientific article |
Statements
Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces (English)
0 references
25 January 2005
0 references
his paper deals with the connectedness of the cone-efficient solution set for vector optimization in locally convex Hausdorff topological vector spaces. The connectedness of the cone-efficient solution set is proved for multiobjective programming defined by a continuous cone-quasiconvex mapping on a compact convex set of alternatives. The generalized saddle theorem plays a key role in the proof.
0 references
Multiobjective programming
0 references
cone-efficient solution
0 references
cone-quasiconvex mapping
0 references
generalized saddle theorem
0 references
connectedness
0 references
