Constraint qualifications in the invex case

Constraint qualifications in the invex case

0.00 Avg rating0 Votes
Article ID: iaor19993144
Country: India
Volume: 19
Issue: 3
Start Page Number: 373
End Page Number: 384
Publication Date: Sep 1998
Journal: Information & Optimization Sciences
Authors: ,
Keywords: constraint programming
Abstract:

The purposes of the present paper are: (1) to weaken certain constraint qualifications (CQs) for a nonlinear programming problem by means of invexity; (2) to study the relationships among the various CQs in the case of a closed set constraint; (3) to give a sufficient condition for the equivalence between the Kuhn–Tucker CQ and the Abadie CQ.

Reviews

Required fields are marked *. Your email address will not be published.