A relaxation solving approach for the linear trilevel programming problem

A relaxation solving approach for the linear trilevel programming problem
复制标题

线性三级规划问题的松弛求解方法

DOI:
10.1007/s40314-021-01617-0
复制
发表时间:
2021-08
影响因子:
2.6
通讯作者:
Jianlin Jiang
Jianlin Jiang
中科院分区:
数学4区
文献类型:
--
作者:
Yibing Lv;Jianlin Jiang

文献摘要

参考文献

相似文献

本文讨论了线性三层规划问题的全局最优解和局部最优解。首先,用最优性条件代替下层问题,得到内部规划问题中带互补约束的双层规划问题。基于内规划问题的最优值函数变换,构造了松弛问题。然后,我们提出了松弛算法,该算法可以逐次逼近所得到的双层规划问题的可行集,并证明了该算法的全局和局部收敛。数值结果表明,该算法是可行和有效的。
In this paper, the global and local optimal solutions of the linear trilevel programming problem are concerned. First, we replace the lower level problem with its optimality conditions, and obtain the bilevel programming problem with the complementary constraints in the inside programming problem. Based on the optimal value function transformation of the inside programming problem, we construct the relaxed problem. Then, we propose the relaxation algorithm, which can approximate the feasible set of the obtained bilevel programming problem successively, and prove the global and local convergence. Numerical results show that the proposed algorithm is feasible and efficient.
DOI: 10.1007/s10287-007-0062-z
发表时间: 2009-10
影响因子: 0.9
作者:
Nuno P. Faísca;P. Saraiva;B. Rustem;E. Pistikopoulos
通讯作者: Nuno P. Faísca;P. Saraiva;B. Rustem;E. Pistikopoulos
DOI: 10.1109/tsmc.1984.6313291
发表时间: 1984
期刊: IEEE Transactions on Systems, Man, and Cybernetics
影响因子: --
作者:
J. Bard
通讯作者: J. Bard
DOI: 10.1023/a:1022610103712
发表时间: 1997-04
影响因子: 1.9
作者:
D. White
通讯作者: D. White
DOI: 10.1016/j.amc.2006.10.045
发表时间: 2007-05
期刊: Appl. Math. Comput.
影响因子: --
作者:
Yibing Lv;T. Hu;Guangmin Wang;Z. Wan
通讯作者: Yibing Lv;T. Hu;Guangmin Wang;Z. Wan
DOI: 10.1007/s10107-010-0395-1
发表时间: 2010-10
影响因子: 2.7
作者:
J. Pang
通讯作者: J. Pang