Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch-and-bound

2004 ◽  
Vol 61 (8) ◽  
pp. 1270-1309 ◽  
Author(s):  
M. Stolpe
Keyword(s):  
Global Optimization ◽  
Branch And Bound ◽  
Minimum Weight ◽  
Local Buckling ◽  
Truss Topology ◽  
Buckling Constraints ◽  
Local Buckling Constraints

Optimally Directed Truss Topology Generation Using Shape Annealing

1995 ◽  
Vol 117 (1) ◽  
pp. 206-209 ◽  
Author(s):  
G. M. Reddy ◽  
J. Cagan
Keyword(s):  
Simulated Annealing ◽  
Minimum Weight ◽  
Truss Structure ◽  
Shape Grammar ◽  
Euler Buckling ◽  
Topology Generation ◽  
Truss Topology ◽  
Buckling Constraints ◽  
Annealing Algorithm

This paper presents a technique for the generation and optimization of truss structure topologies based on the shape annealing algorithm. Feasible truss topologies are generated through a shape grammar in an optimally directed manner using simulated annealing for minimum weight, subject to stress and Euler buckling constraints.

MultiLevel Approach to Minimum Weight Deesign Including Buckling Constraints

AIAA Journal ◽  
1978 ◽  
Vol 16 (2) ◽  
pp. 97-104 ◽  
Author(s):  
L. A. Schmit ◽  
R. K. Ramanathan
Keyword(s):  
Minimum Weight ◽  
Multilevel Approach ◽  
Buckling Constraints

scholarly journals A Global Optimization Algorithm for Sum of Linear Ratios Problem

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Yuelin Gao ◽  
Siqiao Jin
Keyword(s):  
Global Optimization ◽  
Lower Bound ◽  
Programming Problem ◽  
Branch And Bound ◽  
Numerical Experiments ◽  
Original Problem ◽  
Bilinear Programming ◽  
Global Optimization Algorithm ◽  
Product Function ◽  
Optimal Value

We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document