
In this paper we study optimality conditions for an efficient solution in various senses of a general multiobjective optimisation problem in abstract spaces. We utilise properties of the Clarke's generalised differential and properties of a conesubconvexlike function to derive a few necessary and/or sufficient conditions for a feasible solution to be a weak minimum (a minimum, a strong minimum or a proper minimum) of the vector optimisation problem. The results in this paper are extensions and refinements of some known results in vector optimisation.
Programming in abstract spaces, vector minimization, real Banach space, real locally convex separable topological vector space, optimality conditions, efficient solution, Nonsmooth analysis, multiobjective optimization, generalized subdifferential, Duality theory (optimization), Multi-objective and goal programming
Programming in abstract spaces, vector minimization, real Banach space, real locally convex separable topological vector space, optimality conditions, efficient solution, Nonsmooth analysis, multiobjective optimization, generalized subdifferential, Duality theory (optimization), Multi-objective and goal programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 14 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
