ON FINDING NEW VERTICES AND REDUNDANT CONSTRAINTS IN CUTTING PLANE ALGORITHMS FOR GLOBAL OPTIMIZATION

被引：43

作者：

HORST, R ^{[1
]}

DEVRIES, J ^{[1
]}

THOAI, NV ^{[1
]}

机构：

[1] INST MATH,HANOI,VIETNAM

来源：

OPERATIONS RESEARCH LETTERS | 1988年 / 7卷 / 02期

关键词：

MATHEMATICAL MODELS - Optimization - MATHEMATICAL TECHNIQUES - Algorithms;

D O I：

10.1016/0167-6377(88)90071-5

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

A new procedure is presented for solving this subproblem that allows one to handle degeneracy. A theoretical and numerical comparison with existing approaches is given. The paper shows how redundant constraints can be eliminated by a criterion based on the known vertex set of polytope.

引用

页码：85 / 90

页数：6

共 7 条

[1] GENERALIZED CUTTING PLANE ALGORITHMS [J].