The imporved move limit method of sequential linear programming is briefly explained. Comparison of computing efficiencies is made between the improved method and the conventional move limit method with six test problems. The usefulness of the method in the context of structural optimization is shown with the help of four examples. © 1980.

Bhaviktti, S.S.Ramakrishnan, C.V.2026-02-05ComputatioComputers and Structures, 1980, 11, 3, pp. 191-196457949https://doi.org/10.1016/0045-7949(80)90158-3https://idr.nitk.ac.in/handle/123456789/281481980The imporved move limit method of sequential linear programming is briefly explained. Comparison of computing efficiencies is made between the improved method and the conventional move limit method with six test problems. The usefulness of the method in the context of structural optimization is shown with the help of four examples. © 1980.