Abstract
We introduce a new constraint qualification condition in mathematical programming which encompasses the Mangasarian-Fromovitz's condition and the constant rank condition of Janin. Contrarily to the Mangasarian-Fromovitz's condition, our condition is still satisfied when one translates equalities as double inequalities. It relies on the fact that linearization stability is easier to check with equalities than with inequalities.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
