Journal
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS
Volume 50, Issue 10, Pages 1631-1641Publisher
PLEIADES PUBLISHING INC
DOI: 10.1134/S0965542510100015
Keywords
linear bilevel problem; optimistic solution; problem with d.c. inequality; local search; global search; numerical experiment
Categories
Ask authors/readers for more resources
The linear bilevel programming problem in the optimistic formulation is studied. It is reduced to an optimization problem with a nonconvex constraint in the form of a d.c. function (that is, the difference of two convex functions). For this problem, local and global search methods are developed. Numerical experiments performed for numerous specially generated problems, including large-scale ones, demonstrate the efficiency of the proposed approach.
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