Computational efficiency of improved move limit method of sequential linear programming for structural optimization

dc.contributor.authorBhaviktti, S.S.
dc.contributor.authorRamakrishnan, C.V.
dc.date.accessioned2020-03-31T08:18:56Z
dc.date.available2020-03-31T08:18:56Z
dc.date.issued1980
dc.description.abstractThe 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.en_US
dc.identifier.citationComputers and Structures, 1980, Vol.11, 3, pp.191-196en_US
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/10329
dc.titleComputational efficiency of improved move limit method of sequential linear programming for structural optimizationen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
10329.pdf
Size:
432.41 KB
Format:
Adobe Portable Document Format