Optimal Design of Truss Structures by Logic-Based Branch and Cut

Authors:
S. Bollapragada;O. Ghattas;J. N. Hooker
Affiliations:
-;-;-
Venue:
Operations Research
Year:
2001

Citing 0
Cited 9

A scheme for unifying optimization and constraint satisfaction methods

The Knowledge Engineering Review
Scheduling Commercial Videotapes in Broadcast Television

Operations Research
Global optimization of discrete truss topology design problems using a parallel cut-and-branch method

Computers and Structures
Global optimization of truss topology with discrete bar areas--Part II: Implementation and numerical results

Computational Optimization and Applications
An Integrated Solver for Optimization Problems

Operations Research
Generalized Benders' Decomposition for topology optimization problems

Journal of Global Optimization
To bee or not to bee--comments on "Discrete optimum design of truss structures using artificial bee colony algorithm"

Structural and Multidisciplinary Optimization
Convex programming methods for global optimization

COCOS'03 Proceedings of the Second international conference on Global Optimization and Constraint Satisfaction
A new Branch and Bound method for a discrete truss topology design problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The truss design problem is to find the optimal placement and size of structural bars that can support a given load. 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.