The central idea is to solve a sequence of linear programming problems by constructing a local convex hull of a number of data points in the constitutive data set for each structural member …

Oct 12, 2023 · Numerical examples demonstrate the effectiveness of the proposed approach on sparse data set and its robustness with respect to the existence of noise and outliers in the …

Nov 27, 2019 · Linear programming algorithms can operate with a 102 view to seeking basic feasible solutions for either the primal or for the dual system, or by examining 103 solutions …

Mar 1, 2003 · A new SLP algorithm called LESLP was tested in 20 weight minimisation problems of truss structures and four non-truss problems ranging from mathematical programming …

Feb 18, 2025 · Numerical examples demonstrate that for stress-constrained truss optimization problem with the lower bound of cross-sectional area as 0, the proposed algorithm can directly …

Sequential linear programming (SLP) consists of linearizing the objective and constraints in a region around a nominal operating point by a Taylor series expansion. The resulting linear …

Nov 8, 2022 · In this article, an efficient sequential linear programming algorithm (SLP) for uncertainty analysis-based data-driven computational mechanics (UA-DDCM) is presented.