A simple primal solution method for geometric programming is proposed. The method exploits the proximity of geometric and linear programming and is easy to implement by anyone having a linear programming code. Some examples and computational experience are given.