Double penalty method for bilevel optimization problems

Yo Ishizuka, Eitaro Aiyoshi

Research output: Contribution to journalArticlepeer-review

68 Citations (Scopus)


A penalty function method approach for solving a constrained bilevel optimization problem is proposed. In the algorithm, both the upper level and the lower level problems are approximated by minimization problems of augmented objective functions. A convergence theorem is presented. The method is applicable to the non-singleton lower-level reaction set case. Constraint qualifications which imply the assumptions of the general convergence theorem are given.

Original languageEnglish
Pages (from-to)73-88
Number of pages16
JournalAnnals of Operations Research
Issue number1
Publication statusPublished - 1992 Dec 1

ASJC Scopus subject areas

  • General Decision Sciences
  • Management Science and Operations Research


Dive into the research topics of 'Double penalty method for bilevel optimization problems'. Together they form a unique fingerprint.

Cite this