Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 48, Issue 1, Pages 159-172Publisher
SPRINGER
DOI: 10.1007/s10898-009-9514-z
Keywords
Bilevel programming; Optimistic solution; Nonconvex optimization problems; Local search; Global search; Computational simulation
Funding
- Foundation for the Support of National Science (Russia)
- Russian Federation [MK-1497.2008.1, NSh-1676.2008.1]
Ask authors/readers for more resources
The linear-linear and quadratic-linear bilevel programming problems are considered. Their optimistic statement is reduced to a nonconvex mathematical programming problem with the bilinear structure. Approximate algorithms of local and global search in the obtained problems are proposed. The results of computational solving 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
