Primal Geometric Programs Treated by Linear Programming

Necessary and sufficient optimality conditions, requiring no constraint qualifications, are given in terms of associated linear programs which also serve in the characterization of, and the reduction to, canonical programs. An iterative method for solving superconsistent geometric programs, based on the above conditions, is described.