Double penalty method for bilevel optimization problems

Yo Ishizuka; Eitaro Aiyoshi

doi:10.1007/BF02098173

Double penalty method for bilevel optimization problems

Yo Ishizuka, Eitaro Aiyoshi

Department of Applied Physics and Physico-Informatics

Research output: Contribution to journal › Article › peer-review

51 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	73-88
Number of pages	16
Journal	Annals of Operations Research
Volume	34
Issue number	1
DOIs	https://doi.org/10.1007/BF02098173
Publication status	Published - 1992 Dec 1

ASJC Scopus subject areas

Decision Sciences(all)
Management Science and Operations Research

Access to Document

10.1007/BF02098173

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

Cite this

@article{bbafd9d446cd479eb09f98e792b058be,

title = "Double penalty method for bilevel optimization problems",

abstract = "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.",

author = "Yo Ishizuka and Eitaro Aiyoshi",

year = "1992",

month = dec,

day = "1",

doi = "10.1007/BF02098173",

language = "English",

volume = "34",

pages = "73--88",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Double penalty method for bilevel optimization problems

AU - Ishizuka, Yo

AU - Aiyoshi, Eitaro

PY - 1992/12/1

Y1 - 1992/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0010165388&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0010165388&partnerID=8YFLogxK

U2 - 10.1007/BF02098173

DO - 10.1007/BF02098173

M3 - Article

AN - SCOPUS:0010165388

VL - 34

SP - 73

EP - 88

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -

Double penalty method for bilevel optimization problems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this