zbMATH — the first resource for mathematics

A simplified test for optimality. (English) Zbl 0352.90047

90C25 Convex programming
Full Text: DOI
[1] Ben-Israel, A., andBen-Tal, A.,On a Characterization of Optimality in Convex Programming, Mathematical Programming, Vol. 11, pp. 81-88, 1976. · Zbl 0352.90048
[2] Ben-Israel, A., Ben-Tal, A., andCharnes, A.,Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming, Econometrica (to appear). · Zbl 0367.90093
[3] Ben-Tal, A., Ben-Israel, A., andZlobec, S.,Characterization of Optimality in Convex Programming Without Constraint Qualification, Journal of Optimization Theory and Applications, Vol. 20, pp. 417-437, 1976. · Zbl 0327.90025
[4] Fan, K., Glicksburg, I., andHoffman, A.,Systems of Inequalities Involving Convex Functions, American Mathematical Society, Proceedings, Vol. 8, pp. 617-622, 1957. · Zbl 0079.02002
[5] Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, New York 1969.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.