线性二级规划的最优边界面算法  

Optimal Hyperplanes Method for Linear Bilevel Programming

作　　者：林国钧[1] 石明奎[1] 

机构地区：[1]贵州大学,贵阳550025

出　　处：《贵州大学学报（自然科学版）》1995年第1期9-14,共6页Journal of Guizhou University:Natural Sciences

基　　金：贵州省科委科技基金

摘　　要：本文给出线性二级规划的一种非迭代算法,并给出一个算例.Without iteration, we give a method for LBP By the inner-product of the two vectors: projection of d' on the intersection of hyperplane of S and section with given X_1 ,projection of α_1, on section with given X_1 ,and by the inner-product of the two vecters:unit-length projectin of ▽f_1 on the hyperplane of S,unit-length perpendicular rector of other hyperplane, we can choose N hyperplanes of S, their intersection is the optimal point.

关 键 词：二级规划 最优边界面 最优点 线性规划 

分 类 号：O221.1[理学—运筹学与控制论]