摘要
在文 [1]基础上提出一个全搜索方法 ,它通常只需迭代一、二次 ,即可得到一个基可行解。之后依据最优性条件进行的寻优迭代 ,也较文 [2 ]的搜索方位更多 。
In this paper, all direction search method is presented on the basis of [1]. A basic feasible solution is found only to reguire one or two itrations. The itration of finding optimal solution according to the optimality criterion condition is search directions more than [2] and effect is usually better.
出处
《运筹与管理》
CSCD
2000年第2期43-47,共5页
Operations Research and Management Science
关键词
线性规划
基可行解
全搜索
最优性条件
linear programming
basic feasible solution
all direction search
optimality criterion condition
