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.
| dc.contributor.author | Bhaviktti, S.S. | |
| dc.contributor.author | Ramakrishnan, C.V. | |
| dc.date.accessioned | 2026-02-05T11:00:45Z | |
| dc.date.issued | Computational efficiency of improved move limit method of sequential linear programming for structural optimization | |
| dc.description.abstract | 1980 | |
| dc.identifier.citation | Computers and Structures, 1980, 11, 3, pp. 191-196 | |
| dc.identifier.issn | 457949 | |
| dc.identifier.uri | https://doi.org/10.1016/0045-7949(80)90158-3 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/28148 | |
| dc.title | 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. |