A note on two direct methods in linear programming

被引:5
作者
Li, W [1 ]
机构
[1] Southeast Univ, Dept Math, Nanjing 210096, Peoples R China
基金
中国国家自然科学基金;
关键词
linear programming; direct method; most-obtuse-angle method; minimal angle method;
D O I
10.1016/S0377-2217(03)00425-9
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We show that the basic idea behind the work of Stojkovic and Stanimirovic [European Journal of Operational Research 131 (2001) 417-439] is similar to that of "most-obtuse pivot rules", published by Pan since 1990. The further results that the article offer are not correct. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:262 / 265
页数:4
相关论文
共 6 条
[1]  
Pan P.-Q., 1991, OPTIMIZATION, V22, P717
[2]  
PAN PQ, 1990, OR SPEKTRUM, V12, P219, DOI 10.1007/BF01721801
[3]  
PAN PQ, 1994, J INFORMATION OPTIMI, V15, P405
[4]  
PAN PQ, 2004, IN PRESS OR T
[5]  
PAN PQ, 1997, EUR J OPER RES, V101, P167
[6]   Two direct methods in linear programming [J].
Stojkovic, NV ;
Stanimirovic, PS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 131 (02) :417-439