有界变量线性规划的基线算法  

The basic line algorithm for linear programming with bounded variables

作　　者：徐裕生[1] 卢志义[1] 张俊敏[1] 

机构地区：[1]西安建筑科技大学理学院,陕西西安710055

出　　处：《运筹与管理》2006年第1期25-28,共4页Operations Research and Management Science

基　　金：陕西省教育厅专项科研资助基金(03JK065);西安建筑科技大学基础研究基金会(02BR01)

摘　　要：本文对有界变量线性规划的算法进行了研究,得到了一种解此问题的新算法。文中根据基线算法的算法原理,通过对BL表的旋转,在各变量满足界约束的条件下,使目标函数值不断增大,直至得到有界硬上界,从而得到问题的最优解。文中给出了有界变量线性规划基线算法的计算步骤,并给出了一个例子。与单纯形法相比,采用基线算法解有界变量线性规划操作更简单,迭代次数少,解题速度更快。This paper aims to study the algorithm for linear programming with bounded variables and a new algorithm is obtained. Base on the principles of the basic line algorithm, aincreasing sequence of the objective function values are aquired by the transforming of the BL table, and consequently the hard upper bound also the optimal solution is obtained. The procedures for this method and an example are given . The method provided has several advantages compared with the simplex method, that are more simple, easer to operate, fewer iteration times and quicker to work the results out.

关 键 词：运筹学 线性规划 基线算法 有界变量 硬上界 

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