【摘要】 利用线性双层规划的全局最优解可在其约束域的极点上达到这一性质,通过对问题可行解集合的结构进行探讨,引进一种割平面技术,提出了一个求解线性双层规划的全局收敛算法,并通过一个算例说明了算法的求解过程.更多还原

【Abstract】 Based on the result that a global optimal solution to linear bilevel programming occurs at an extreme point of its constraint region, we discuss the structural feature of its feasible region and propose a global convergent algorithm which make use of cutting plane technique. Finally, a simple example is given to illustrate the application of the algorithm.更多还原