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...
Saved in:
| Main Authors: | , |
|---|---|
| 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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1729-7648 |