Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/33583
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMinchenko, L. I.-
dc.contributor.authorBerezhnov, D. E.-
dc.date.accessioned2018-11-22T12:20:24Z-
dc.date.available2018-11-22T12:20:24Z-
dc.date.issued2017-
dc.identifier.citationMinchenko, L. I. On global partial calmness for bilevel programming problems with linear lower-level problem / L. I. Minchenko, D. E. Berezhnov // OPTIMA'2017 : proceedings of the VIII International Conference on Optimization and Applications, Petrovac, Oct. 2 - 7, 2017 / CEUR-WS. – Petrovac, 2017. - P.412 - 419.ru_RU
dc.identifier.urihttps://libeldoc.bsuir.by/handle/123456789/33583-
dc.description.abstractWe consider bilevel programs such that their lower level problem is linear with respect to the lower level variable. It is known that such programs are partially calm and, therefore, can be reduced to a one level optimization problem by means of local penalization. One of the goals of our paper is to show that these programs can be reduced to a one level optimization problem via a global exact penalization. In the paper we also prove sufficient conditions of partial calmness for bilevel programs and study the pseudo-Lipschitzian continuity (Aubin property) of the solution mapping of the lower level problem.ru_RU
dc.language.isoenru_RU
dc.publisherCEUR-WSru_RU
dc.subjectпубликации ученыхru_RU
dc.subjectbilevel programmingru_RU
dc.subjectpartial calmnessru_RU
dc.subjectoptimal value functionru_RU
dc.subjectpenalizationru_RU
dc.subjectsolution mappingru_RU
dc.subjectpseudo-Lipschitzian continuityru_RU
dc.titleOn global partial calmness for bilevel programming problems with linear lower-level problemru_RU
dc.typeСтатьяru_RU
Appears in Collections:Публикации в зарубежных изданиях

Files in This Item:
File Description SizeFormat 
Berezhnov_On.pdf97.45 kBAdobe PDFView/Open
Show simple item record Google Scholar

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.