临界区间法求解线性规划问题  

Critical Interval Method for Solving Linear Programming

作　　者：王玉清[1] 

机构地区：[1]太原理工大学阳泉学院,山西阳泉045001

出　　处：《华北工学院学报》2004年第6期453-456,共4页Journal of North China Institute of Technology

摘　　要：　给出了求线性规划问题最优解的临界区间算法,这种算法是在已知LP(λ)的临界区间[λk,λk-1]的条件下,用单纯形法和对偶单纯形法进行旋转运算,求得[λk,λk-1]的包含临界值λ=0的紧后临界区间[λk+1,λk],其优点是不需要基本可行解或对偶基本可行解.This paper gives the critical interval method for solving linear programming. Under the condition of having known LP(λ) critical interval , this method can get closer critical interval involving critical value λ=0 of , by rotate calculation through simplex method and dual simplex method. It′ advantage is that it does not need basic feasible solution or dual basic feasible solution.

关 键 词：线性规划问题 对偶单纯形 旋转运算 求解 最优解 基本可行解 区间 临界区 算法 单纯形法 

分 类 号：TH112[机械工程—机械设计及理论] O221.1[理学—运筹学与控制论]