期刊
NUMERICAL ANALYSIS AND APPLICATIONS
卷 3, 期 2, 页码 165-173出版社
SIBERIAN BRANCH RUSSIAN ACAD SCIENCES
DOI: 10.1134/S1995423910020059
关键词
bilevel programming; optimistic solution; nonconvex optimization problems; local search; computational simulation
资金
- Russian Foundation for Support of Domestic Science [MK-1497.2008.1, NSh-1676.2008.1]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
