Note on Mangasarian–Fromovitz-Like Constraint Qualifications

  • Leonid MinchenkoEmail author
Technical Note


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.


Constraint qualifications Nonlinear programming 

Mathematics Subject Classification

90C30 90C31 90C46 



This research was supported by Belarussian State Program for Fundamental Research “Mathematical Simulation Methods to Complicated Systems”


  1. 1.
    Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Neyman, J. (ed.) Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, pp. 481–492. University of California Press, Berkeley (1951)Google Scholar
  2. 2.
    Mangasarian, O.L., Fromovitz, S.: The Fritz-John necessary optimality conditions in presence of equality and inequality constraints. J. Math. Anal. Appl. 7, 37–47 (1967)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Janin, R.: Directional derivative of the marginal function in nonlinear programming. Math. Program. Study 21, 110–126 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Minchenko, L.I., Stakhovski, S.M.: On relaxed constant rank regularity condition in mathematical programming. Optimization 60, 429–440 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Minchenko, L., Stakhovski, S.: About generalizing the Mangasarian–Fromovitz regularity condition. Dokl. BGUIR 8, 104–109 (2010). (in Russian)Google Scholar
  6. 6.
    Kruger, A.Y., Minchenko, L.I., Outrata, J.V.: On relaxing the Mangasarian–Fromovitz constraint qualification. Positivity 18, 171–189 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Andreani, R., Haeser, G., Schuverdt, M.L., Silva, P.J.S.: Two new weak constraint qualifications and applications. SIAM J. Optim. 22, 1109–1125 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Andreani, R., Martinez, J.M., Schuverdt, M.L.: On the relations between constant positive linear dependence condition and quasinormality constraint qualification. J. Optim. Theory Appl. 125, 473–485 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Andreani, R., Haeser, G., Schuverdt, M.L., Silva, P.J.S.: A relaxed constant positive linear dependence constraint qualification and applications. Math. Program. 135, 255–273 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Giannessi, F.: Constrained Optimization and Image Space Analysis, Separation of Sets and Optimality Conditions, vol. 1. Springer, New York (2005)zbMATHGoogle Scholar
  11. 11.
    Moldovan, A., Pellegrini, L.: On regularity for constrained extremum problems. Part 2: necessary optimality conditions. J. Optim. Theory Appl. 142, 165–183 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Guo, L., Zhang, J., Lin, G.-H.: New results on constraint qualifications for nonlinear extremum problems and extensions. J. Optim. Theory Appl. 163, 737–754 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Lu, S.: Implications of the constant rank constraint qualification. Math. Program. 126, 365–392 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Lu, S.: Relation between the constant rank and the relaxed constant rank constraint qualifications. Optimization 61, 555–566 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Gorokhovik, V.V.: Finite-Dimensional Optimization Problems. BSU Publishing, Minsk (2007)zbMATHGoogle Scholar
  16. 16.
    Zorich, V.A.: Mathematical Analysis, P. 1. Springer, Berlin (2004)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Belarusian State University of Informatics and RadioelectronicsMinskBelarus

Personalised recommendations