Abstract
A number of sufficiency theorems in the mathematical programming literature, concerning problems with equality constraints, are shown to be trivial consequences of the corresponding results for inequality constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bector, C. R., andGulati, T. R. Sufficient Optimality Conditions in Presence of Quasi-Convex Equality and Inequality Constraints, Mathematische Operationsforschung und Statistik, Serie: Optimization, Vol. 8, pp. 181–184, 1977.
Bhatt, S. K., andMisra, S. K. Sufficient Optimality Criteria in Nonlinear Programming in the Presence of Convex Equality and Inequality Constraints, Zeitschrift fur Operations Research, Vol. 19, pp. 101–105, 1975.
Mahajan, D. G., andVartak, M. N. Generalization of Some Duality Theorems in Nonlinear Programming, Mathematical Programming, Vol. 12, pp. 293–317, 1977.
Singh, C.,Sufficient Optimality Criteria in Nonlinear Programming for Generalized Equality-Inequality Constraints, Journal of Optimization Theory and Applications, Vol. 22, pp. 631–635, 1977.
Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill, New York, New York, 1969.
Author information
Authors and Affiliations
Additional information
Communicated by O. L. Mangasarian
This work was supported by NSF Grant No. ECS-8214081. Research by the first author was done while a visitor at La Trobe University.
Rights and permissions
About this article
Cite this article
Ben-Israel, A., Mond, B. On sufficient optimality conditions for mathematical programs with equaiity constraints. J Optim Theory Appl 47, 253–255 (1985). https://doi.org/10.1007/BF00940772
Issue Date:
DOI: https://doi.org/10.1007/BF00940772