Journal
NUMERICAL ANALYSIS AND APPLICATIONS
Volume 3, Issue 2, Pages 165-173Publisher
SIBERIAN BRANCH RUSSIAN ACAD SCIENCES
DOI: 10.1134/S1995423910020059
Keywords
bilevel programming; optimistic solution; nonconvex optimization problems; local search; computational simulation
Categories
Funding
- Russian Foundation for Support of Domestic Science [MK-1497.2008.1, NSh-1676.2008.1]
Ask authors/readers for more resources
A quadratic-linear bilevel programming problem is considered. Its optimistic statement is reduced to a series of nonconvex unilevel problems. An approximate algorithm for global search in reduced problems is proposed. Numerical solutions of randomly generated test problems are given and analyzed.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
