On a Compound Duality Classification for Geometric Programming

A classification table for geometric programming is given in this paper. The table is exhaustive and exclusive with only one state in each row and each column. It proves that out of 49 possible duality states, only seven are possible. The proofs of theorems leading to the classification table are based on the new states, which are defined according to the newly defined homogenized programs for both the primal and dual geometric programming.