Calculation of stationary points in linear bilevel programming problems
Bilevel programming problems are considerably difficult for numerical analysis. Despite the vast amount of literature and research dedicated to studying them, there are no universal methods to solve them and numerous publications are concerned mainly with identifying particular subsets of problems t...
Saved in:
| 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/905 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On partial calmness for bilevel programming problem with a linear lower-level problem
by: D. E. Berezhnov, et al.
Published: (2019-06-01) -
ON THE PROBLEMS OF BILEVEL OPTIMIZATION UNDER RCPLD CONSTRAINT QUALIFICATIONS
by: L. I. Minchenko, et al.
Published: (2019-12-01) -
Maximizing Tax Revenue for Profit Maximizing Monopolist with the Cobb-Douglas Production Function and Linear Demand as a Bilevel Programming Problem
by: Zrinka Lukač, et al.
Published: (2025-04-01) -
Net-Zero Energy House-Oriented Linear Programming for the Sizing Problem of Photovoltaic Panels and Batteries
by: A. Daniel Carnerero, et al.
Published: (2024-01-01) -
Issues on a 2–Dimensional Quadratic Sub–Problem and Its Applications in Nonlinear Programming: Trust–Region Methods (TRMs) and Linesearch Based Methods (LBMs)
by: Giovanni Fasano, et al.
Published: (2024-12-01)