A mathematical programming algorithm for limit analysis

1991 ◽  
Vol 7 (3) ◽  
pp. 267-274 ◽  
Author(s):  
Zhang Pixin ◽  
Lu Mingwan ◽  
Hwang Kehchih
Keyword(s):  
Mathematical Programming ◽  
Limit Analysis ◽  
Programming Algorithm

Limit analysis using the ellipsoid yield surface

1994 ◽  
Vol 445 (1925) ◽  
pp. 519-527
Keyword(s):  
Mathematical Programming ◽  
Yield Surface ◽  
Limit Analysis ◽  
Iteration Process ◽  
Mathematical Programming Problem ◽  
Plastic Limit ◽  
Polyester Composite ◽  
Plastic Limit Analysis ◽  
Element Technique ◽  
Kinematic Theorem

The ellipsoid yield surface can be applied to many engineering materials, such as metal, concrete, polyester, composite, etc. It is essential to establish an efficient method to carry out the plastic limit analysis of such media. Based on the classical kinematic theorem of plasticity theory and the finite element technique, a discrete mathematical programming formula is presented to determine the collapse load for materials with ellipsoid yield surface. The mathematical programming problem is solved by an efficient algorithm including an iteration process. The convergency of the algorithm is guaranteed. Numerical examples are presented and the results are reasonable and satisfactory.

Frontiers in Engineering Optimization

1983 ◽  
Vol 105 (2) ◽  
pp. 151-154 ◽  
Author(s):  
J. T. Betts
Keyword(s):  
Mathematical Programming ◽  
Engineering Problem ◽  
Theory And Practice ◽  
Programming Algorithm ◽  
Engineering System ◽  
Engineering Optimization ◽  
Complex Engineering ◽  
Optimization Operator

The successful application of a mathematical programming algorithm to a complex engineering problem requires a careful interfacing of needs and requirements between the optimization operator and the engineering system. This paper outlines some areas where interface requirements have not been successfully resolved. In order to bridge the frontier between theory and practice, issues are identified which require resolution by both algorithm developers and system engineers.

An Improved Direct Search Mathematical Programming Algorithm

1975 ◽  
Vol 97 (4) ◽  
pp. 1305-1310 ◽  
Author(s):  
M. Pappas ◽  
J. Y. Moradi
Keyword(s):  
Mathematical Programming ◽  
Direction Finding ◽  
Direct Search ◽  
Pattern Search ◽  
New Method ◽  
Programming Algorithm ◽  
Test Problems ◽  
Feasible Direction ◽  
Search Termination

An improved, nonlinear, constrained algorithm is presented, coupling a rotating coordinate pattern search with a feasible direction finding procedure used at points of pattern search termination. The procedure is compared with eighteen algorithms, including most of the popular methods, on ten test problems. These problems are such that the majority of codes failed to solve more than half of them. The new method proved superior to all others in the overall generality and efficiency rating, being the only one solving all problems.

Sign in / Sign up

Export Citation Format

Share Document