重庆工商大学学报（自然科学版）

引用本文:	赵礼阳1，霍永亮2.求二层线性规划最优解的极点方法(J/M/D/N,J:杂志，M：书，D：论文，N：报纸).期刊名称,2015，32（11）：89-92
	CHEN X. Adap tive slidingmode contr ol for discrete2ti me multi2inputmulti2 out put systems[ J ]. Aut omatica, 2006, 42(6): 4272-435

【打印本页】【下载PDF全文】【查看/发表评论】【EndNote】【RefMan】【BibTex】

←前一篇|后一篇→

过刊浏览高级检索

本文已被：浏览 777次下载 2226次	码上扫一扫！
分享到：微信更多字体:加大+\|默认\|缩小-
求二层线性规划最优解的极点方法
赵礼阳1，霍永亮2^1,2
1.重庆师范大学数学学院,重庆 401331;2.重庆文理学院数学与财经学院,重庆 402160

摘要:

根据二层线性规划的最优解一定可以在约束集的极点找到这一理论，给出了求解二层线性规划的极点方法，通过上层目标函数值的排序，避免了盲目验证极点这一缺陷，最后通过算例描述了算法求解过程，并验证了算法的有效性.

关键词: 二层线性规划约束条件全局最优解极点

DOI：

分类号:

基金项目:

The Method of Getting Extreme Point of the Optimal Solution toBilevel Linear Programming

ZHAO Li yang1 ,HUO Yong liang2

Abstract:

According to the theory that the optimal solution to bilevel linear programming can be found on the extreme point of the constraint set,a method of getting extreme point of bilevel linear programming is presented. Through the top objective function sorting,this method avoids the shortcoming of verifing extreme point aimlessly. Finally,calculation example describles the perocess of algorithm for solving,and the effectiveness of the algorithm is verified.

Key words: bilevel linear programming constraint condition globle optimal solution exeme point