Duality theorems for K-convex functions
Abstract
In this paper we have considered K-convex functions which are generalized convex functions and established the weak duality theorem, the strong duality theorem and the converse duality theorem for a pair of symmetric dual nonlinear programming problems.
Copyright © 2013 B. Sunita Mishra, Jyotiranjan Nayak. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
B. S. Mishra, J. Nayak, Duality theorems for K-convex functions, J. Math. Comput. Sci. 3 (2013), 1295–1305.
BibTeX
@article{Mishra2013,
author = {Mishra, B. Sunita and Nayak, Jyotiranjan},
title = {Duality theorems for K-convex functions},
journal = {J. Math. Comput. Sci.},
volume = {3},
year = {2013},
pages = {1295--1305},
doi = {}
}