Two‐Level Approach to Design of Short Concrete Columns
Publication: Journal of Structural Engineering
Volume 117, Issue 12
Abstract
A new strategy is presented to optimize the design of short concrete columns of general shape, subjected to multiple loading conditions. This strategy consists of decomposing the problem into two subproblems. In the lower‐level problem, the deformations are fixed and the reinforcement is optimized. The higher‐level problem finds the deformations that correspond to the minimum possible total steel area. This approach is particularly effective because the lower‐level problem is a linear programming problem involving most of the variables. The higher‐level problem is not continuously differentiable, and a solution is obtained through the application of a bundle method. The examples presented herein demonstrate the efficiency of the proposed approach, which reduces the computation time to less than one‐third of that required by the original, undecomposed problem.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Barthelemy, J. F., and Sobieszczanski‐Sobieski, J. (1983). “Optimum sensitivity derivatives of objective functions in nonlinear programming.” AIAA J., 21(6), 913–915.
2.
Felix, J., and Vanderplaats, G. N. (1987). “Configuration optimization of trusses subject to strength, displacement and frequency constraints.” J. Mech. Transm. Autom. Des., ASME, 109(2), 233–241.
3.
Gill, P. E., and Murray, W. (1973). “A numerically stable form of the simplex algorithm.” Linear Algebra and its Applications, 7(1), 99–138.
4.
Hiriart‐Urruty, J. B. (1982). “ε‐subdifferential calculus.” Convex Analysis and Optimization, Research Notes in Mathematics, Series 57, Pitman, London, U.K., 43–92.
5.
Horowitz, B. (1989). “Design of columns subjected to biaxial bending.” ACI Struct. J., 86(6), 717–722.
6.
Kirsch, U. (1981). Optimum structural design. McGraw‐Hill, New York, N.Y., 198—215.
7.
Lemaréchal, C. (1986). “An introduction to the theory of nonsmooth optimization.” Optimization, 17(6), 827–858.
8.
Lemaréchal, C., Strodiot, D. D., and Bihain, A. (1981). “On a bundle algorithm for nonsmooth optimization.” Nonlinear Programming 4, O. L. Mangasarian, R. R. Meyer, and S. R. Robinson, eds., Academic Press, New York, N.Y., 245–282.
9.
Luenberger, D. G. (1984). Linear and nonlinear programming. Second Ed., Addison‐Wesley, Reading, Mass.
10.
Mifflin, R. (1979). “A stable method for solving certain constrained least squares problems.” Math. Program., 16, 141–158.
11.
Mifflin, R. (1984). “Stationarity and superlinear convergence of an algorithm for univariate locally Lipschitz constrained minimization.” Math. Program., 28, 50–71.
12.
Rotter, J. M. (1985). “Rapid exact inelastic biaxial bending analysis.” J. Struct. Engrg., ASCE, 111(12), 2659–2674.
13.
Strodiot, J. J., Nguyen, V. H., and Heukemes, N. (1983). “ε‐optimal solutions in nondifferentiable convex programming and some related questions.” Math. Program., 25, 307–328.
14.
Strodiot, J. J., and Nguyen, V. H. (1987). “On the numerical treatment of the inclusion Report 87/1, Dept. of Mathematics, University of Namur, Namur, Belgium.
15.
Vanderplaats, G. N. (1984). Numerical optimization techniques for engineering design with applications. McGraw‐Hill, New York, N.Y.
Information & Authors
Information
Published In
Copyright
Copyright © 1991 ASCE.
History
Published online: Dec 1, 1991
Published in print: Dec 1991
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.