A practical and efficient optimization method for the rational design of large, highly constrained complex systems is presented. The design of such systems is iterative and requires the repeated formulation and solution of an analysis model, followed by the formulation and solution of a redesign model. The latter constitutes an optimization problem. The versatility and efficiency of the method for solving the optimization problem is of fundamental importance for a successful implementation of any rational design procedure. In this paper, a method is presented for solving optimization problems formulated in terms of continuous design variables. The objective function may be linear or non-linear, single or multiple. The constraints may be any mix of linear or non-linear functions, and these may be any mix of inequalities and equalities. These features permit the solution of a wide spectrum of optimization problems, ranging from the standard linear and non-linear problems to a non-linear problem with multiple objective functions (goal programming). The algorithm for implementing the method is presented in sufficient detail so that a computer program, in any computing language, can be written.
No takes yet. Share an insight, caveat, or question.
Mistree et al. (1981) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: