A note on the weak Arrow-Hurwicz-Uzawa constraint qualification

MaRDI QIDQ1102195zbMATH OpenFDO

Authors B. George

Publication date 1987

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

weak Arrow-Hurwicz-Uzawa constraint qualification

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Review text

The following nonlinear programming problem is considered: \[ (NLP)\text{Maximize }f(x)\quad s.t.\quad x\in X\equiv \{x\in R^ n| g(x)\leq 0\}, \] where \(f: R^ n\to R\) and \(g: R^ n\to R^ m\) are differentiable functions. The concept of the weak Arrow-Hurwicz-Uzawa constraint qualification for the problem (NLP) is introduced. A necessary condition for this constraint qualification is derived.

Recommendations

• scientific article; zbMATH DE number 6988801
• Constraint qualification in a general class of nondifferentiable mathematical programming problems
• Constraint qualifications in a class of nondifferentiable mathematical programming problems
• scientific article; zbMATH DE number 4202037
• On constraint qualifications in nonlinear programming

Cited in

(2)

• Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints
• Efficiency and proper efficiency in nonlinear vector maximum problems

This page was built for publication: A note on the weak Arrow-Hurwicz-Uzawa constraint qualification

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