AbstractThe impedance scaling process and Norton's transformation are formulated in a uniform manner as a Cauer‐Howitt transformation with diagonal matrices. For passive two‐element‐kind ladder networks the realizability conditions are reduced to linear inequality constraints. An algorithm is given to enumerate all vertices of the realizability polyhedrons which represent all equivalent networks with a minimum number of elements. In addition a cost function meeting practical requirements is stated and optimized, taking into account various orders of network compl