Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
✍ Scribed by Radu Ioan Boţ; Ioan Bogdan Hodrea; Gert Wanka
- Book ID
- 111488450
- Publisher
- SP Versita
- Year
- 2008
- Tongue
- English
- Weight
- 350 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1895-1074
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we present necessary and sufficient conditions of efficiency and weak efficiency under generalized cone-convexity and cone-subconvexity. The results are stated in partially ordered real linear spaces from a separation theorem between convex cones which need not be solid.
In this paper, the so-called η-approximation approach is used to characterize solvability (in Pareto sense) of a nonlinear multiobjective programming problem with G-invex functions with respect to the same function η. In this method, an equivalent η-approximated vector optimization problem is constr