Abstract
A new class of convex functions, namely, (b, F)-convex functions is introduced. Sufficient optimality conditions and duality results are established for nonlinear programming problems under (b, F)-convexity assumptions on the functions involved. Further, we extend these results to fractional programming problems.
Similar content being viewed by others
References
C.R. BECTOR, Mathematical Analysis of some Nonlinear Programming Problems, Indian Institute of Technology, Kanpur, India, Ph.D Thesis, 1968.
C.R. BECTOR, and C. SINGH, B-vex Function, Journal of Optimization Theory and Applications, 71, 237–253 (1991).
C.R. BECTOR, S. SUNEJA, and C. S. LALITHA, Generalized B-vex functions and Generalized B-vex Programming, Journal of Optimization theory and Applications, 76, 651–1576 (1993).
M. A. HANSON and B. MOND, Further generalizations of Convexity in Mathematical Programming, Journal of Information and Optimization Sciences, 3, 25–31 (1982).
O.L. MANGASARIAN, Non-Linear Programming, McGraw Hill, New York, New York, 1969.
D.G. MAHAJAN, and M.N. VARTAK, Generalization of Some Duality Theorems in Nonlinear Programming, Mathematical Programming, 12, 293–317 (1977).
B. MOND, and T. WEIR, Generalized Concavity and Duality, Generalized Concavity in Optimization and Economics (Edited by S. Schaible and W. T. Ziemba), Academic press, New York, pp. 268–279, 1981.
P. WOLFE, A Duality Theorem for Non-linear Programming quarterly Applied Mathematics, 19, 239–244 (1961).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pandian, P., Kanniappan, P. Duality for Nonlinear Programming Problems Involving (b, F) - Convexity. OPSEARCH 36, 172–180 (1999). https://doi.org/10.1007/BF03398572
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398572