Second order duality for mathematical programming involving n-set functions
Resumo
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.
Downloads
Não há dados estatísticos.
Publicado
2017-09-23
Edição
Seção
Artigos
Copyright (c) 2017 Boletim da Sociedade Paranaense de Matemática

This work is licensed under a Creative Commons Attribution 4.0 International License.
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).