Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/10329
Full metadata record
DC FieldValueLanguage
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.identifier.citationComputers and Structures, 1980, Vol.11, 3, pp.191-196en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/10329-
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.titleComputational efficiency of improved move limit method of sequential linear programming for structural optimizationen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
10329.pdf432.41 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.