Cutting Planes for Programs with Disjunctive Constraints

被引：14

作者：

Owen, G. ^{[1
]}

机构：

[1] Rice Univ, Houston, TX 77251 USA

来源：

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 1973年 / 11卷 / 01期

关键词：

D O I：

10.1007/BF00934290

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

A type of program is considered in which, apart from the usual linear constraints, it is required that at least one variable from each of several sets be equal to zero. Applications include complementary pivot theory and concave minimization problems. Cutting planes are generated for the solution of such programs. A geometrical description of the cutting planes explains their meaning.

引用

页码：49 / 55

页数：7