Proving strong duality for geometric optimization using a conic formulation (Q5959331)

The author presents new simplified proofs of the duality theorems of geometric programming using a conic formulation. Section 2 introduces convex cones and conic optimization problem and presefts the properties of the convex cones introduced. In section 3 the author presents a conic formulation of the geometric programming problem. Section 4 presents proofs of the duality results valid for the geometric programming problem, based on the results proved in section 2. Section 5 contains the concluding remarks.