<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">vestifm</journal-id><journal-title-group><journal-title xml:lang="ru">Известия Национальной академии наук Беларуси. Серия физико-математических наук</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-2430</issn><issn pub-type="epub">2524-2415</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">vestifm-69</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICS</subject></subj-group></article-categories><title-group><article-title>СЛАБО РЕГУЛЯРНЫЕ ЗАДАЧИ МАТЕМАТИЧЕСКОГО ПРОГРАММИРОВАНИЯ</article-title><trans-title-group xml:lang="en"><trans-title>WEAKLY REGULAR MATHEMATICAL PROGRAMMING PROBLEMS</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Лещев</surname><given-names>А. Е.</given-names></name><name name-style="western" xml:lang="en"><surname>Leschov</surname><given-names>A. E.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Минченко</surname><given-names>Л. И.</given-names></name><name name-style="western" xml:lang="en"><surname>Minchenko</surname><given-names>L. I.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники, Минск</institution></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics, 	Minsk</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>17</day><month>05</month><year>2016</year></pub-date><volume>0</volume><issue>2</issue><fpage>64</fpage><lpage>70</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Лещев А.Е., Минченко Л.И., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Лещев А.Е., Минченко Л.И.</copyright-holder><copyright-holder xml:lang="en">Leschov A.E., Minchenko L.I.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestifm.belnauka.by/jour/article/view/69">https://vestifm.belnauka.by/jour/article/view/69</self-uri><abstract><p>В данной статье исследуется ослабленное условие регулярности Мангасаряна Фромовица (RMFCQ) и доказывается, что его выполнение влечет выполнение условия .R-регулярности (error bound property) без дополнительных требований существования непрерывных вторых производных для функций в ограничениях задачи.</p></abstract><trans-abstract xml:lang="en"><p>In this article nonlinear programming problemis considered under the relaxed Mangasarian-Fromovitzconstraint qualification. We prove that the relaxed Mangasarian-Fromovitz constraint qualification implies the local error bound property without additional assumptions for constraints.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Mangasarian O. L., Fromovitz S. // J. Math. Analysisand Appl. 1967. Vol. 17. P. 37-47.</mixed-citation><mixed-citation xml:lang="en">Mangasarian O. L., Fromovitz S. // J. Math. Analysisand Appl. 1967. Vol. 17. P. 37-47.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Janin R. // Mathematical Programming Study. 1984. Vol. 21. P. 110-126.</mixed-citation><mixed-citation xml:lang="en">Janin R. // Mathematical Programming Study. 1984. Vol. 21. P. 110-126.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Minchenko L., Stakhovski S. // Optimization. 2011. Vol. 60, N 4. P. 429-440.</mixed-citation><mixed-citation xml:lang="en">Minchenko L., Stakhovski S. // Optimization. 2011. Vol. 60, N 4. P. 429-440.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Minchenko L, Stakhovski S. // SIAM J. Optimiz. 2011. Vol. 21, N 1. P. 314-332.</mixed-citation><mixed-citation xml:lang="en">Minchenko L, Stakhovski S. // SIAM J. Optimiz. 2011. Vol. 21, N 1. P. 314-332.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Qi L, Wei Z. // SIAM J. Optimiz. 2000. Vol. 10. P. 963-981.</mixed-citation><mixed-citation xml:lang="en">Qi L, Wei Z. // SIAM J. Optimiz. 2000. Vol. 10. P. 963-981.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Andreani R., Martinez J. M., Schuverdt M. L. // J. Optimiz. Theory and Appl. 2005. Vol. 125. P. 473-485.</mixed-citation><mixed-citation xml:lang="en">Andreani R., Martinez J. M., Schuverdt M. L. // J. Optimiz. Theory and Appl. 2005. Vol. 125. P. 473-485.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Andreani R., Haeser G., SchuverdtM. L., Silva P. J. S. // Mathematical Programming. Ser. A. 2012. Vol. 135. P. 255-273.</mixed-citation><mixed-citation xml:lang="en">Andreani R., Haeser G., SchuverdtM. L., Silva P. J. S. // Mathematical Programming. Ser. A. 2012. Vol. 135. P. 255-273.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Минченко Л. И., Стаховский С. М. // Докл. БГУИР. 2010. № 8. С. 104-109.</mixed-citation><mixed-citation xml:lang="en">Минченко Л. И., Стаховский С. М. // Докл. БГУИР. 2010. № 8. С. 104-109.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Andreani R., Haeser G., SchuverdtM. L., Silva P. J. S. // SIAM J. Optimiz. 2012. Vol. 22, N 3. P. 1109-1135.</mixed-citation><mixed-citation xml:lang="en">Andreani R., Haeser G., SchuverdtM. L., Silva P. J. S. // SIAM J. Optimiz. 2012. Vol. 22, N 3. P. 1109-1135.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Minchenko L., Tarakanov A. // J. Optimiz. Theory and Appl. 2011. Vol. 148. P. 571-579.</mixed-citation><mixed-citation xml:lang="en">Minchenko L., Tarakanov A. // J. Optimiz. Theory and Appl. 2011. Vol. 148. P. 571-579.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Bosch P., Jourani A., Henrion R. // Applied Mathematics and Appl. 2004. Vol. 50. P. 161-181.</mixed-citation><mixed-citation xml:lang="en">Bosch P., Jourani A., Henrion R. // Applied Mathematics and Appl. 2004. Vol. 50. P. 161-181.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Henrion R., Jourani A., Outrata J. // SIAM J. Optimiz. 2002. Vol. 13. P. 603-618.</mixed-citation><mixed-citation xml:lang="en">Henrion R., Jourani A., Outrata J. // SIAM J. Optimiz. 2002. Vol. 13. P. 603-618.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Рокафеллар Р. Т. Выпуклый анализ. М., 1971.</mixed-citation><mixed-citation xml:lang="en">Рокафеллар Р. Т. Выпуклый анализ. М., 1971.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Гороховик В. В. Конечномерные задачи оптимизации. Минск, 2007.</mixed-citation><mixed-citation xml:lang="en">Гороховик В. В. Конечномерные задачи оптимизации. Минск, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Зорич В. А. Математический анализ. М., 1981. Ч. 1.</mixed-citation><mixed-citation xml:lang="en">Зорич В. А. Математический анализ. М., 1981. Ч. 1.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
