A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem

Bo Zeng ()
Additional contact information
Bo Zeng: Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, Pennsylvania 15261

INFORMS Journal on Computing, 2020, vol. 32, issue 4, 1128-1142

Abstract: In this paper, we present a new computation scheme for the pessimistic bilevel optimization problem, which so far does not have any computational methods generally applicable. We first develop a tight relaxation and then design a simple scheme to ensure a feasible and optimal solution. Then we discuss using this scheme to analyze and compute a linear pessimistic bilevel problem and several extensions. We also provide demonstrations on illustrative examples and a systematic numerical study on instances of two practical problems. Because of its simple structure and strong computational capacity, we believe that the developed scheme is of critical value in studying and solving pessimistic bilevel optimization problems arising from practice.

Keywords: bilevel optimization; pessimistic; computing; level reduction (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1287/ijoc.2019.0927 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:32:y:4:i:2020:p:1128-1142

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().