On partial calmness for bilevel programming problem with a linear lower-level problem

Numerous publications are devoted to bilevel programming problems. Despite a seemingly simple statement these problems are considerably difficult for numerical solving, and a significant part of research in the field of bilevel programming is devoted to identifying particular subsets of problems tha...

Full description

Saved in:
Bibliographic Details
Main Authors: D. E. Berezhnov, L. I. Minchenko
Format: Article
Language:Russian
Published: Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
Series:Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
Subjects:
Online Access:https://doklady.bsuir.by/jour/article/view/882
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1839567919640477696
author D. E. Berezhnov
L. I. Minchenko
author_facet D. E. Berezhnov
L. I. Minchenko
author_sort D. E. Berezhnov
collection DOAJ
description Numerous publications are devoted to bilevel programming problems. Despite a seemingly simple statement these problems are considerably difficult for numerical solving, and a significant part of research in the field of bilevel programming is devoted to identifying particular subsets of problems that allow for a numerical solution. One of such subsets consists of bilevel problems that possess the partial calmness property. Global partial calmness of bilevel programming problems with a linear lower-level problem is proven in this article.
format Article
id doaj-art-b82b9ee472b14d3db0c6ee99fad6b115
institution Matheson Library
issn 1729-7648
language Russian
publishDate 2019-06-01
publisher Educational institution «Belarusian State University of Informatics and Radioelectronics»
record_format Article
series Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
spelling doaj-art-b82b9ee472b14d3db0c6ee99fad6b1152025-08-04T17:38:17ZrusEducational institution «Belarusian State University of Informatics and Radioelectronics»Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki1729-76482019-06-01058992881On partial calmness for bilevel programming problem with a linear lower-level problemD. E. Berezhnov0L. I. Minchenko1Belarusian state university of informatics and radioelectronicsBelarusian state university of informatics and radioelectronicsNumerous publications are devoted to bilevel programming problems. Despite a seemingly simple statement these problems are considerably difficult for numerical solving, and a significant part of research in the field of bilevel programming is devoted to identifying particular subsets of problems that allow for a numerical solution. One of such subsets consists of bilevel problems that possess the partial calmness property. Global partial calmness of bilevel programming problems with a linear lower-level problem is proven in this article.https://doklady.bsuir.by/jour/article/view/882optimizationbilevel programmingpartial calmness
spellingShingle D. E. Berezhnov
L. I. Minchenko
On partial calmness for bilevel programming problem with a linear lower-level problem
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
optimization
bilevel programming
partial calmness
title On partial calmness for bilevel programming problem with a linear lower-level problem
title_full On partial calmness for bilevel programming problem with a linear lower-level problem
title_fullStr On partial calmness for bilevel programming problem with a linear lower-level problem
title_full_unstemmed On partial calmness for bilevel programming problem with a linear lower-level problem
title_short On partial calmness for bilevel programming problem with a linear lower-level problem
title_sort on partial calmness for bilevel programming problem with a linear lower level problem
topic optimization
bilevel programming
partial calmness
url https://doklady.bsuir.by/jour/article/view/882
work_keys_str_mv AT deberezhnov onpartialcalmnessforbilevelprogrammingproblemwithalinearlowerlevelproblem
AT liminchenko onpartialcalmnessforbilevelprogrammingproblemwithalinearlowerlevelproblem