Some nondifferentiable multiobjective programming under generalized d-V-type-I univexity
β Scribed by Anurag Jayswal; Rajnish Kumar
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 461 KB
- Volume
- 229
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we introduce new classes of functions called d-V-type-I univex by extending the definition of d-V-type-I functions and consider a multiobjective optimization problem involving generalized d-V-type-I univex functions. A number of Karush-Kuhn-Tucker-type sufficient optimality conditions are obtained for a feasible solution to be a weak Pareto efficient solution. The Mond-Weir-type duality results are also presented. The results obtained in this paper generalize and extend the previously known result in this area.
π SIMILAR VOLUMES
In this paper we extend a (scalarized) generalized type-I invexity into a vector invexity (V-type I). A number of sufficiency results are established using Lagrange multiplier conditions and under various types of generalized V-type I requirements. Weak, strong, and converse duality theorems are pro
weak) Pareto optimal solution d-r-type I objective and constraint functions Optimality conditions Duality a b s t r a c t In this paper, new classes of nondifferentiable functions constituting multiobjective programming problems are introduced. Namely, the classes of d-r-type I objective and constr