<?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">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">bsuir-149</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></article-categories><title-group><article-title>ОСЛАБЛЕННОЕ УСЛОВИЕ РЕГУЛЯРНОСТИ МАНГАСАРЯНА-ФРОМОВИЦА И ЕГО ПРИЛОЖЕНИЯ</article-title><trans-title-group xml:lang="en"><trans-title>RELAXED MANGASARIAN-FROMOVITZ CONSTRAINT QUALIFICATION AND ITS APPLICATIONS</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>Aktanarovich</surname><given-names>S. V.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><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>Bogdanov</surname><given-names>S. A.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><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>Leschov</surname><given-names>A. E.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><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><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2013</year></pub-date><pub-date pub-type="epub"><day>03</day><month>06</month><year>2019</year></pub-date><volume>0</volume><issue>2</issue><fpage>5</fpage><lpage>9</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Актанорович С.В., Богданов С.А., Лещев А.Е., Минченко Л.И., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Актанорович С.В., Богданов С.А., Лещев А.Е., Минченко Л.И.</copyright-holder><copyright-holder xml:lang="en">Aktanarovich S.V., Bogdanov S.A., 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://doklady.bsuir.by/jour/article/view/149">https://doklady.bsuir.by/jour/article/view/149</self-uri><abstract><p>Условия регулярности играют важную роль в задачах математического программирования поскольку гарантируют выполнение необходимых условий оптимальности Куна-Таккера и построение на их основе двойственных алгоритмов для вычисления оптимальных решений. В то же время условия регулярности различаются между собой общностью, сравнительной простотой проверки и условиями применения. Наряду с классическими условиями регулярности (в первую очередь это известное условие Мангасаряна-Фромовица), в последнее время вызывают значительный интерес более слабые условия регулярности, применимые в задачах, для которых не имеют места классические условия. Целью данной работы является исследование ослабленного условия регулярности Мангасаряна-Фромовица и его связи с другими условиями регулярности.</p></abstract><trans-abstract xml:lang="en"><p>Nonlinear programming problems are considered under the relaxed Mangasarian-Fromovitz constraint qualification. It was established that a new constraint qualification CRSC is another form of relaxed Mangasarian-Fromovitz constraint qualification and proved that the relaxed Mangasarian-Fromovitz constraint qualification implies the local error bound property under not essential additional assumptions.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>математическое программирование</kwd><kwd>оптимальность</kwd><kwd>условия регулярности</kwd><kwd>ослабленные условия</kwd></kwd-group></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. // Mathematical Analysis and Appl. 1967. №17. P. 37-47.</mixed-citation><mixed-citation xml:lang="en">Mangasarian, O.L., Fromovitz, S. // Mathematical Analysis and Appl. 1967. №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. № 21. P. 110-126.</mixed-citation><mixed-citation xml:lang="en">Janin R. // Mathematical Programming Study. 1984. № 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. № 60 (4). P. 429-440.</mixed-citation><mixed-citation xml:lang="en">Minchenko L., Stakhovski S. // Optimization. 2011. № 60 (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 Journal on Optimization. 2011. № 21 (1). P. 314-332.</mixed-citation><mixed-citation xml:lang="en">Minchenko L., Stakhovski S. // SIAM Journal on Optimization. 2011. № 21 (1). P. 314-332.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Bertsekas D.P. Convex analysis and optimization. Athens, 2003.</mixed-citation><mixed-citation xml:lang="en">Bertsekas D.P. Convex analysis and optimization. Athens, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Федоров В.В. Численные методы максимина. М., 1979.</mixed-citation><mixed-citation xml:lang="en">Федоров В.В. Численные методы максимина. М., 1979.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Ioffe A.D. Regular points of Lipschitz functions. // Transactions of American Mathematical Society.</mixed-citation><mixed-citation xml:lang="en">Ioffe A.D. Regular points of Lipschitz functions. // Transactions of American Mathematical Society.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Luderer B., Minchenko L., Satsura T. Multivalued analysis and nonlinear programming problems with perturbations. Dordrecht/Boston/London, 2002.</mixed-citation><mixed-citation xml:lang="en">Luderer B., Minchenko L., Satsura T. Multivalued analysis and nonlinear programming problems with perturbations. Dordrecht/Boston/London, 2002.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Minchenko L., Tarakanov A. // Optimization Theory and Appl. 2011. № 148. P. 571-579.</mixed-citation><mixed-citation xml:lang="en">Minchenko L., Tarakanov A. // Optimization Theory and Appl. 2011. № 148. P. 571-579.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Andreani R., Martinez J.M., Schverdt M.L. // Optimization Theory and Appl. 2005. №125. P.473-485.</mixed-citation><mixed-citation xml:lang="en">Andreani R., Martinez J.M., Schverdt M.L. // Optimization Theory and Appl. 2005. №125. P.473-485.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Qi L., Wei A. // SIAM Journal on Optimization. 2000. № 10 (4). P. 963-981.</mixed-citation><mixed-citation xml:lang="en">Qi L., Wei A. // SIAM Journal on Optimization. 2000. № 10 (4). P. 963-981.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Andreani R., Haeser G., Schuverdt M.L., et. al. // Mathematical Programming, Ser. A 135. 2012. P. 255-273.</mixed-citation><mixed-citation xml:lang="en">Andreani R., Haeser G., Schuverdt M.L., et. al. // Mathematical Programming, Ser. A 135. 2012. P. 255-273.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Shu Lu. // Mathematical Programming. 2009. №126 (2). P. 365-392.</mixed-citation><mixed-citation xml:lang="en">Shu Lu. // Mathematical Programming. 2009. №126 (2). P. 365-392.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Shu Lu. Relation between the constant rank and the relaxed constant rank constraint qualifications // Optimization, 2010. DOI:10.1080/02331934.2010.527972.</mixed-citation><mixed-citation xml:lang="en">Shu Lu. Relation between the constant rank and the relaxed constant rank constraint qualifications // Optimization, 2010. DOI:10.1080/02331934.2010.527972.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Solodov M.V. Wiley Encyclopedia of Operations Research and Management Science, chapter Constraint Qualifications. NJ, USA, 2011.</mixed-citation><mixed-citation xml:lang="en">Solodov M.V. Wiley Encyclopedia of Operations Research and Management Science, chapter Constraint Qualifications. NJ, USA, 2011.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</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="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">R.Andreani, G. Haeser, M.L.Schuverdt, et. al. Two new weak constraint qualifications and applications // Optimization Online Preprint, 2011-07-3105.</mixed-citation><mixed-citation xml:lang="en">R.Andreani, G. Haeser, M.L.Schuverdt, et. al. Two new weak constraint qualifications and applications // Optimization Online Preprint, 2011-07-3105.</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>
