On the Vertex Enumeration Problem in Cutting Plane Algorithms of Global Optimization
作者： Reiner Horst
DOI: 10.1007/978-3-642-76537-7_2
关键词: Mathematics 、 Hyperplane 、 Discrete mathematics 、 Vertex enumeration problem 、 Global optimization 、 Combinatorics 、 Vertex (graph theory) 、 Polytope 、 Set (abstract data type) 、 Cutting plane algorithm 、 Adjacency list
摘要: We consider the following vertex enumeration problem: (VE) Given a hyperplane H and polytope P with known set V(P) find of \(\bar = \cap H\).
springer.com
sci-hub.st 参考文章(28)
M Backmann, None, Lectu re Notes in Economics and Mathematical Systems ,(1975)
T. Gal, Shadow prices and sensitivity analysis in linear programming under degeneracy Operations-Research-Spektrum. ,vol. 8, pp. 59- 71 ,(1986) , 10.1007/BF01719736
R. Horst, On the global minimization of concave functions Or Spektrum. ,vol. 6, pp. 195- 205 ,(1984) , 10.1007/BF01720068
H.-J. Kruse, Degeneracy graphs and the neighbourhood problem ,(1986)
Reiner Horst, Tuy Hoang, Global Optimization: Deterministic Approaches ,(1992)
James E. Falk, Karla R. Hoffman, A Successive Underestimation Method for Concave Minimization Problems Mathematics of Operations Research. ,vol. 1, pp. 251- 259 ,(1976) , 10.1287/MOOR.1.3.251
Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard, On-line and off-line vertex enumeration by adjacency lists Operations Research Letters. ,vol. 10, pp. 403- 409 ,(1991) , 10.1016/0167-6377(91)90042-N
Tomas Gal, Hermann-Josef Kruse, Peter Zörnig, Survey of solved and open problems in the degeneracy phenomenon Mathematical Programming. ,vol. 42, pp. 125- 133 ,(1988) , 10.1007/BF01589397
R. Horst, Ng.V. Thoai, H. Tuy, On an outer approximation concept in global optimization Optimization. ,vol. 20, pp. 255- 264 ,(1989) , 10.1080/02331938908843440
M. E. Dyer, The Complexity of Vertex Enumeration Methods Mathematics of Operations Research. ,vol. 8, pp. 381- 402 ,(1983) , 10.1287/MOOR.8.3.381