A note on constraint qualification for saddle point conditions involving convex and linear affine functions

BMC Marine Science · Springer Nature · 2026-05-04 · DOI: 10.1007/s11750-026-00716-7

Аннотация

We take into consideration the classical saddle point conditions for programming problems involving convex functions, linear affine functions and a convex set constraint. We prove a nonlinear theorem of the alternative, and we discuss the relationships between the Slater constraint qualification and a constraint qualification proposed by Neustadt (Neustadt LW. Academic Press, New York, pp 323–348,1970) .

Читать у издателя →

Похожие статьи