Solution of structural optimization problems by piecewise linearization

Lorentzen, R.

doi:10.1090/qam/678207

Author: R. Lorentzen
Journal: Quart. Appl. Math. 40 (1982), 353-355
MSC: Primary 73K40
DOI: https://doi.org/10.1090/qam/678207
MathSciNet review: 678207
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Structural optimization problems tend to be nonlinear and often also non-convex. In this paper it is proposed to reduce a general class of such problems to linear programming problems through piecewise linearization. They can then be solved by the highly effective linear programming computer codes currently available.

A. J. Morris, Generalization of dual structural optimization problems in terms of fractional programming, Quart. Appl. Math. 36 (1978/79), no. 2, 115–119. MR 496698, DOI https://doi.org/10.1090/S0033-569X-1978-0496698-5

H. M. Salkin, Integer programming, Addison-Wesley, 1975, pp. 5–6

R. J. Duffin and E. L. Peterson, Geometric programming with signomials, J. Optim. Theory Appl. 11 (1973), 3–35. MR 327309, DOI https://doi.org/10.1007/BF00934288