On sufficiency for mathematical programming problems with equilibrium constraints

DOI10.2298/YJOR130207021MMaRDI QIDQ5403599zbMATH OpenFDO

Authors Yogendra Pandey, S. K. Mishra

Publication date 26 March 2014

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

sufficient optimality conditionhigher-order strong convexity

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Stationary conditions for global or local optimality under some mathematical programs with equilibrium constraints
• Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
• Strict minimizers of order \(m\) in nonsmooth optimization problems.

Cited in

(3)

• On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
• Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
• A necessary and sufficient condition for Altman's maximal element problem for constraint sets with many equalities

This page was built for publication: On sufficiency for mathematical programming problems with equilibrium constraints

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