An efficient algorithm is presented for decomposing constraint equatio
ns defining an engineering design. It is assumed that the design probl
em is modelled mathematically by m independent, nonconflicting algebra
ic equations (constraints) in n design variables. The design procedure
is initiated by specifying (or inputting) (n-m) variables, one by one
. The algorithm uses an active occurrence-matrix approach to determine
which variables can be computed, and the most efficient sequence for
computing these variables. The procedure is independent of the order i
n which the input variable(s) are specified.