4.6 Article

An exact penalty method for weak linear bilevel programming problem

Journal

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING
Volume 42, Issue 1-2, Pages 41-49

Publisher

SPRINGER HEIDELBERG
DOI: 10.1007/s12190-012-0620-6

Keywords

Linear bilevel programming; Weak linear bilevel programming; Penalty method

Funding

  1. National Science Foundation of China [71171150, 71201146]
  2. Huanggang Normal University

Ask authors/readers for more resources

In this paper, we present an exact penalty method, which is different from the existing penalty method, for solving weak linear bilevel programming problem. Then, we establish an existence result of solutions for such a problem. Finally, we propose an algorithm and give two examples to illustrate its feasibility.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available