Mixed type duality for a programming problem containing support function
β Scribed by I. Husain; Z. Jabeen
- Publisher
- Springer-Verlag
- Year
- 2004
- Tongue
- English
- Weight
- 166 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1598-5865
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A sufficient optimality theorem is proved for a certain minmax programming Ε½ . problem under the assumptions of proper b, -invexity conditions on the functions involved in the objective and in the constraints. Next a dual is presented for such a problem and duality theorems relating the primal and t
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