Optimal design of truss structures by logic-based branch and cut

被引:37
作者
Bollapragada, S
Ghattas, O
Hooker, JN
机构
[1] GE Co, Corp Res & Dev, Informat Technol Lab, Schenectady, NY 12301 USA
[2] Carnegie Mellon Univ, Dept Civil & Environm Engn, Pittsburgh, PA 15213 USA
[3] Carnegie Mellon Univ, Grad Sch Ind Adm, Pittsburgh, PA 15213 USA
关键词
D O I
10.1287/opre.49.1.42.11196
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The truss design problem is to find the optimal placement and size of structural bars that can support a given lend. The problem is nonlinear and, in the version addressed here, the bars must take certain discrete sizes. It is shown that a logic-based method that dispenses with integer variables and branches directly on logical disjunctions can solve substantially larger problems than mixed integer programming, even though the nonlinearities disappear in the mixed integer model. A primary purpose of the paper is to investigate whether advantages of logic-based branching that have been demonstrated elsewhere for linear problems extend to nonlinear programming.
引用
收藏
页码:42 / 51
页数:10
相关论文
共 45 条
[1]  
[Anonymous], 1993, FDN CONSTRAINT SATIS
[2]   DISJUNCTIVE PROGRAMMING AND A HIERARCHY OF RELAXATIONS FOR DISCRETE OPTIMIZATION PROBLEMS [J].
BALAS, E .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (03) :466-486
[3]   NOTE ON DUALITY IN DISJUNCTIVE PROGRAMMING [J].
BALAS, E .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1977, 21 (04) :523-528
[4]  
Barth P., 1995, Logic -Based 0-1 Constraint Programming
[5]   AN ALGORITHM FOR DISJUNCTIVE PROGRAMS [J].
BEAUMONT, N .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 48 (03) :362-371
[6]   SOLUTION OF MIXED-DISCRETE STRUCTURAL OPTIMIZATION PROBLEMS WITH A NEW SEQUENTIAL LINEARIZATION ALGORITHM [J].
BREMICKER, M ;
PAPALAMBROS, PY ;
LOH, HT .
COMPUTERS & STRUCTURES, 1990, 37 (04) :451-461
[7]  
CAI J, 1993, ENG OPT, V21, P293
[8]  
CAI JG, 1994, AIAA S MULT AN OPT, P1239
[9]  
Colmerauer A., 1973, Technical report
[10]  
DINCBAS M, 1988, P INT C 5 GEN COMP S