Affiliation:
1. Veer Surendra Sai University of Technology Burla
Abstract
The notion of second order convexity and its generalization for $n$-set functions are introduced. Mond-weir type second order duality is formulated for the general mathematical programming problems involving $n$-set functions, and proved desired duality theorems. Further, counterexamples are illustrated in support of the present investigation.
Publisher
Sociedade Paranaense de Matematica
Reference36 articles.
1. 1. C.R. Bector and S. Chandra, Generalized bonvex functions and second-order duality in mathematical programming. Research Report 85-2, Department of Actuarial and Management Sciences, The University of Manitoba, Winnepeg, Manitoba, Canada, January (1985).
2. 2. D. Begis and R. Glowinski, Application de la methode des elements finis a l'approximation d'un probleme de domaine optimal. Methodes de resolution des problemes approches. Applied Math. opt., 2(2), 130-169, (1975).
3. Quelques reultats sur l'identification de domaines.
4. Second order optimality conditions for mathematical programming with set functions.
5. On multiple objective programming problems with set functions.