Abstract
This final chapter on network-type problems deals with finding the best design of a structure to support a specified load at a fixed set of points. The topology of the problem is described by a graph where each node represents a joint in the structure and each arc represents a potential member.1 We shall formulate this problem as a linear programming problem whose solution determines which of the potential members to include in the structure and how thick each included member must be to handle the load. The optimization criterion is to find a minimal weight structure. As we shall see, the problem bears a striking resemblance to the minimum-cost network flow problem that we studied in Chapter 14.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Michell, A. (1904), ‘The limits of economy of material in frame structures’, Phil. Mag. 8, 589–597.
Dorn, W., Gomory, R. & Greenberg, H. (1964), ‘Automatic design of optimal structures’, J. de M’ecanique 3, 25–52.
Hemp, W. (1973), Optimum Structures, Clarendon Press, Oxford.
Bendsøe, M., Ben-Tal, A. & Zowe, J. (1994), ‘Optimization methods for truss geometry and topology design’, Structural Optimization 7, 141–159.
Recski, A. (1989), Matroid Theory and its Applications in Electric Network Theory and in Statics, Springer-Verlag, Berlin-Heidelberg-New York.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Robert J.Vanderbei
About this chapter
Cite this chapter
Vanderbei, R.J. (2008). Structural Optimization. In: Linear Programming. International Series in Operations Research & Management Science, vol 114. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74388-2_16
Download citation
DOI: https://doi.org/10.1007/978-0-387-74388-2_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74387-5
Online ISBN: 978-0-387-74388-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)