Abstract
We consider constraint qualifications in nonlinear programming which can be reduced to the classical Mangasarian–Fromovitz condition with the help of a new parametrization of the set of feasible points.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
