On suffucient optimality conditions for mathematical programs with equality constraints

DOI10.1007/BF00940772MaRDI QIDQ799484zbMATH OpenOpenAlexFDO

Authors Adi Ben-Israel, Bertram Mond

Publication date 1985

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00940772

zbMATH Keywords

equality constraintsfirst-order optimality conditionsinequality constraintssufficient conditions

Mathematics Subject Classification ID

Optimality conditions for free problems in two or more independent variables (49K10) Nonlinear programming (90C30)

Review text

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.

Cites work

• A lagrangian approach to duality for complex nonlinear fractional programming over cones
• Generalization of some duality theorems in nonlinear programming
• Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints

Cited in

(5)

• Characterizations of linear suboptimality for mathematical programs with equilibrium constraints
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• Optimality conditions for mathematical programs with orthogonality type constraints
• A necessary and sufficient condition for Altman's maximal element problem for constraint sets with many equalities
• scientific article; zbMATH DE number 6147934 (Why is no real title available?)

This page was built for publication: On suffucient optimality conditions for mathematical programs with equality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799484)