Abstract
A special class of nonlinear non differentiable programming problem containing square root term in the objective function as well as in the constraints is considered. Necessary and sufficient conditions of optimality are given under strong pseudoinvexity assumption on the functions involved. These conditions are then used to establish duality theorems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
John, F. (1948), Extremum Problem with Inequalities as side Conditions in: Studies and Essays, Courant Anniversary Volume, K.O. Friedricks, O.E. nengebauer and J.J. Stoker (eds.), Wiley-Interscience, N.Y.
Kanniapan, P and Pandian, P. (1995), Duality for Nonlinear Programming Problems with Strong Pseudoinvexity Constraints, opsearch, 32(2), 96–104.
Kuhn, K.W. and Tueker, A.W. (1951), Nonlinear Programming. Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, University of California Press.
Kumar, A. and Agarwal, J.P. (1994), A note on a class of Non-differentiable Programming Problems, Int. J. Management and System, 10(2), 189–194.
Kumar, A. and Ghosh, S. (1998), Duality with strong Pseudoinvexity, Journal of Decision and Mathematika Sciences, Vol. 3, No. 1–3, 37–44.
Kumar, A. and Ghosh, S. (1998), On Duality with Strong Pseudoinvexity over Cone Domain, Aeta Ciencia Indica. 24(4), 317–320.
Kumar, A. and Ghosh, S. (2001), Strong Pseudoinvexity over Cone Domain, The Mathematics Education, 35(2), 78–81.
Mangasarin, O.L. and Fromovitz, S. (1967), The Fritz-John Necessary Optimality conditions in the presence of Equality and Inequality constraints, J. Math. Anal. Appln., 17, 37–47.
Misra, A.D. (1975), Optimality Criteria for a class of Non-differentiable Mathematica Programmes, Opsearch, 15, 91–106.
Mond, B. (1957), A Class of Non-differentiable Mathematical Programming Problem, J. Math, Anal. Appln., 46, 169–174.
Mond, B. and Weir, T. (1981), Generalized Concavity and Duality in: Generalized Concavity in Optimization and Economics (eds.) S. Sehaibe and W.T. Ziemba, Academic Press, N.Y., 263–279.
Mond, B. (1976), Symmetric Duality for a Nonlinear Programming, Opsearch, 13(1), 1–10.
Sinha, S.M. and Aylawadi, D.R. (1982), Optimality Conditions for a class of Non-differentiable Mathematical Programming Problems, Opsearch, 19(4), 225–237.
Sinha, S.M. and Aylawadi, D.R. (1982), Optimality Criteria for a class of Non-differentiable Mathematical Programs, ZAMM, 62.
Wolfe, P. (1961), A Duality Theorem for Nonlinear Programming, Quart, Appl. Math., 19, 239–224.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kumar, A., Ghosh, S. A Non-differentiable Programming Problem under Strong Pseudoinvexity. OPSEARCH 40, 299–304 (2003). https://doi.org/10.1007/BF03398703
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398703