ALGORITHM FOR DETERMINING ALL EXTREME POINTS OF A CONVEX POLYTOPE

被引:58
作者
DYER, ME [1 ]
PROLL, LG [1 ]
机构
[1] UNIV LEEDS,LEEDS LS1 3EX,ENGLAND
关键词
D O I
10.1007/BF01593771
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:81 / 96
页数:16
相关论文
共 23 条
[1]  
[Anonymous], 1958, STUDIES LINEAR NONLI
[2]  
BALINSKI M, 1961, J SIAM, P72
[3]  
Berge C., 1962, THEORY GRAPHS ITS AP
[4]  
BURDET GA, 1974, SIAM J APPL MATH, V26, P479
[5]   SOLVING CERTAIN NONCONVEX QUADRATIC MINIMIZATION PROBLEMS BY RANKING EXTREME POINTS [J].
CABOT, AV ;
FRANCIS, RL .
OPERATIONS RESEARCH, 1970, 18 (01) :82-&
[6]  
Charnes A., 1953, INTRO LINEAR PROGRAM
[7]  
Chernikova N., 1965, COMP MATH MATH PHYS+, V5, P228
[8]   ALGORITHM FOR DETERMINING REDUNDANT INEQUALITIES AND ALL SOLUTIONS TO CONVEX POLYHEDRA [J].
GREENBERG, H .
NUMERISCHE MATHEMATIK, 1975, 24 (01) :19-26
[9]  
Grunbaum B, 1967, CONVEX POLYTOPES
[10]  
Hadley G., 1962, LINEAR PROGRAMMING