In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We dene a class of optimization problems as CH-posynomial programs and reveal a general dominance property for all CH-posynomial programs (Theorem 1). We show that the STIS problems under a number of transistor delay models are CH-posynomial programs and propose an ecient and near-optimal STIS algorithm based on the dominance property. When used to solve the simultaneous driver/buer and wire sizing problem for real designs, it reduces the maximum delay by up to 16.1%, and more signicantly, reduces the power consump