Second order duality for mathematical programming involving n-set functions

Joydev Dasmahapatra; Saroj Kumar Padhan

doi:10.5269/bspm.v37i3.31883

Joydev Dasmahapatra Veer Surendra Sai University of Technology Burla Department of Mathematics
Saroj Kumar Padhan Veer Surendra Sai University of Technology Burla Department of Mathematics

DOI: https://doi.org/10.5269/bspm.v37i3.31883

Résumé

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.

Téléchargements

Les données sur le téléchargement ne sont pas encore disponible.

Biographie de l'auteur

Saroj Kumar Padhan, Veer Surendra Sai University of Technology Burla Department of Mathematics

I received my Ph.D. degree from Indian Institute of Technology Kharagpur in 2011. After that I am working as an assistant professor at Veer Surendra Sai University of Technology Burla from 11.08.2011 to till date. My area of research are applied mathematics and optimization, fractional calculus, number theory. I have published my research papers in many reputed journal like Computer and Mathemartics with Applications, Applied Mathematics and Computations, Nonlinear Analysis: Hybrid Systems, Mathematical Methods in Applied Sciences, Journal Applied Mathematics and Computing etc