6533b870fe1ef96bd12cefae
RESEARCH PRODUCT
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
Abderrahim Jouranisubject
Constraint (information theory)Constraint algorithmsymbols.namesakeMathematical optimizationControl and OptimizationComputingMilieux_THECOMPUTINGPROFESSIONApplied MathematicsLagrange multiplierTheory of computationsymbolsManagement Science and Operations ResearchConstraint satisfactionMathematicsdescription
In this paper, we present several constraint qualifications, and we show that these conditions guarantee the nonvacuity and the boundedness of the Lagrange multiplier sets for general nondifferentiable programming problems. The relationships with various constraint qualifications are investigated.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1994-06-01 | Journal of Optimization Theory and Applications |