Second-Order Duality for Nondifferentiable Minimax Programming Involving Generalized Type I Functions
โ Scribed by S. K. Mishra; N. G. Rueda
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 146 KB
- Volume
- 130
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Two types of second-order dual models are formulated for a nondifferentiable minmax programming problem and usual duality results are established involving generalized type-I functions.
A pair of Mond-Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K -F -convexity assumptions. Our results generalize several known results in the literature.
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