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) -
Regular subgraphs of linear extension graphs
by: O. S. Bondarenko
Published: (2011-07-01) -
Linear programming with inequality constraints via entropic perturbation
by: H.-S. Jacob Tsao, et al.
Published: (1996-01-01) -
Addressing Fuzzy Linear Programming Problems Through Ranking Functions
by: Sozan Saber Haidar
Published: (2024-10-01) -
ANALYSIS OF ELEVENTH-GRADE VOCATIONAL HIGH SCHOOL STUDENTS PROBLEM-SOLVING ABILITY IN LINEAR PROGRAMMING
by: Nurfatma Sari, et al.
Published: (2025-05-01)