Since its initial appearance more than four decades ago, geometric programming has proved itself to be a powerful means of solving many optimization problems, particularly those that pertain to engineering design. The theory has been generalized to provide a structure for the analysis of any convex programming problem. Here we trace the development of geometric programming from its initial use as a trick for solving certain cost‐optimization problems to its current status as a fully fledged branch of optimization theory. Examples drawn from inventory theory and engineering reinforce and motivate this development.