Lower bound limit analysis using finite elements and linear programming

Abstract This paper describes a technique for computing lower bound limit loads in soil mechanics under conditions of plane strain. In order to invoke the lower bound theorem of classical plasticity theory, a perfectly plastic soil model is assumed, which may be either purely cohesive or cohesive‐frictional, together with an associated flow rule. Using a suitable linear approximation of the yield surface, the procedure computes a statically admissible stress field via finite elements and linear programming. The stress field is modelled using linear 3‐noded traingles and statically admissible stress discontinuities may occur at the edges of each triangle. Imposition of the stress‐boundary, equilibrium and yield conditions leads to an expression for the collapse load which is maximized subject to a set of linear constraints on the nodal stresses. Since all of the requirements for a statically admissible solution are satisfied exactly (except for small round‐off errors in the optimization computations), the solution obtained is a strict lower bound on the true collapse load and is therefore ‘safe’. A major drawback of the technique, as first described by Lysmer, 1 is the large amount of computer time required to solve the linear programming problem. This paper shows that this limitation may be avoided by using an active set algorithm, rather than the traditional simplex or revised simplex strategies, to solve the resulting optimization problem. This is due to the nature of the constraint matrix, which is always very sparse and typically has many more rows that columns. It also proved that the procedure can, without modification, be used to derive strict lower bounds for a purely cohesive soil which has increasing strength with depth. This important class of problem is difficult to tackle using conventional methods. A number of examples are given to illustrate the effectiveness of the procedure.