Optimality conditions and duality results for a robust bi-level programming problem
Robust bi-level programming problems are a newborn branch of optimization theory. In this study, we have considered a bi-level model with constraint-wise uncertainty at the upper-level, and the lower-level problem is fully convex. We use the optimal value reformulation to transform the given bi-leve...
Saved in:
| Published in: | R.A.I.R.O. Recherche opérationnelle Vol. 57; no. 2; pp. 525 - 539 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.03.2023
|
| ISSN: | 0399-0559, 2804-7303 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!