This paper presents a technique for solving nonlinear programming problems with nonconvex feasible regions. The procedure expands the feasible region by replacing nonlinear equality constraints by appropriate inequality constraints. The expansion is used to solve two structural optimization problems using the sequential unconstrained-minimization technique of Fiacco and McCormick. The solutions are compared with solutions obtained by classical mathematical methods.

This content is only available via PDF.
You do not currently have access to this content.