Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/10329
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bhaviktti, S.S. | - |
dc.contributor.author | Ramakrishnan, C.V. | - |
dc.date.accessioned | 2020-03-31T08:18:56Z | - |
dc.date.available | 2020-03-31T08:18:56Z | - |
dc.date.issued | 1980 | - |
dc.identifier.citation | Computers and Structures, 1980, Vol.11, 3, pp.191-196 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/10329 | - |
dc.description.abstract | 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. | en_US |
dc.title | Computational efficiency of improved move limit method of sequential linear programming for structural optimization | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Journal Articles |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.