A note on the dual of an unconstrained (generalized) geometric programming problem