1. Dempe, S. Foundations of Bilevel programming / S. Dempe. - Dordrecht; Boston; London, 2002. - 282 p. https://doi.org/10.1007/b101970

2. Bard, J. F. Practical Bilevel Optimization / J. F. Bard. - Dordrecht; Boston; London, 1998. - 454 p. https://doi. org/10.1007/978-1-4757-2836-1

3. Outrata, J. V. A note on the usage of nondifferentiable exact penalties in some special optimization Problems / J. V. Outrata // Kybernetika. - 1988. - Vol. 24, N 4. - P. 251-258.

4. Ye, J. J. Optimality conditions for bilevel programming problems / J. J. Ye, D. L. Zhu // Optimization. - 1995. - Vol. 33, N 1. - P. 9-27. https://doi.org/10.1080/02331939508844060

5. Ye, J. J. New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches / J. J. Ye, D. L. Zhu // SIAM J. Optim. - 2010. - Vol. 20, N 4. - P. 1885-1905. https://doi.org/10.1137/080725088

6. Dempe, S. New necessary optimality conditions in optimistic bilevel programming / S. Dempe, J. Dutta, B. S. Mordukhovich // Optimization. - 2007. - Vol. 56, N 5-6. - P. 577-604. https://doi.org/10.1080/02331930701617551

7. Henrion, R. On calmness conditions in convex bilevel programming / R. Henrion, T. M. Surowiec // Applicable Analysis. - 2011. - Vol. 90, N 6. - P. 951-970. https://doi.org/10.1080/00036811.2010.495339

8. Minchenko, L. I. On global partial calmness for bilevel programming problems with linear lower-level problem / L. I. Minchenko, D. E. Bereznov // Proceedings of Conference OPTIMA-2017. - Petrovac, Montenegro, 2017. - P. 412-419.

9. Dempe, S. The bilevel programming: reformulations, constraint qualifications and optimality conditions / S. Dempe, A. B. Zemkoho // Mathematical Programming. - 2013. - Vol. 138, N 1-2. - P. 447-473. https://doi.org/10.1007/s10107-011-0508-5

10. Minchenko, L. I. On relaxed constant rank regularity condition in mathematical programming / L. I. Minchenko, S. M. Stakhovski // Optimization. - 2011. - Vol. 60, N 4. - P. 429-440. https://doi.org/10.1080/02331930902971377

11. Minchenko, L. Parametric nonlinear programming problems under the relaxed constant rank condition / L. Minchenko, S. Stakhovski // SIAM J. Optim. - 2011. - Vol. 21, N 1. - P. 314-332.

12. Федоров, В. В. Численные методы максимина / В. В. Федоров. - М., 1979. - 280 с.

13. Luderer, B. Multivalued analysis and nonlinear programming problems with perturbations / B. Luderer, L. Minchenko, T. Satsura. - Dordrecht; Boston; London, 2002. - 210 p. https://doi.org/10.1007/978-1-4757-3468-3

14. Rockafellar, R. T. Variational analysis / R. T. Rockafellar, R. J.-B. Wets. - Berlin, 1998. - 734 p. https://doi.org/10.1007/978-3-642-02431-3

15. Кларк, Ф. Оптимизация и негладкий анализ / Ф. Кларк. - М., 1988. - 280 с.