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.
@article{31883,
title = {Second order duality for mathematical programming involving n-set functions},
journal = {Boletim da Sociedade Paranaense de Matem\'atica},
volume = {37},
year = {2017},
doi = {10.5269/bspm.v37i3.31883},
language = {EN},
url = {http://dml.mathdoc.fr/item/31883}
}
Dasmahapatra, Joydev; Padhan, Saroj Kumar. Second order duality for mathematical programming involving n-set functions. Boletim da Sociedade Paranaense de Matemática, Tome 37 (2017) . doi : 10.5269/bspm.v37i3.31883. http://gdmltest.u-ga.fr/item/31883/