期刊
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS
卷 50, 期 10, 页码 1631-1641出版社
PLEIADES PUBLISHING INC
DOI: 10.1134/S0965542510100015
关键词
linear bilevel problem; optimistic solution; problem with d.c. inequality; local search; global search; numerical experiment
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据