Abstract
This note comments on the dimensioning aspect of small rectangular floor plans that is described by Mitchell et al (1976). It outlines the requirements for an optimization algorithm to be used for dimensioning architectural plans and shows that dynamic programming satisfies the requirements. It demonstrates that dynamic programming can handle the integer nonlinear programming problem to produce the global optimum and that the algorithm used by Mitchell et al cannot. Stability and sensitivity considerations are discussed and it is stated that, through the use of the concept of invariant embedding, all feasible assignments may be imbedded in a single dimensionless representation which may then be operated on directly by dynamic programming.

This publication has 0 references indexed in Scilit: