Geometric programming and dual entropy-optimization problem

摘要

In this paper, we have analyzed the equivalence of entropy-maximization models to geometric programs. We also derive a dual geometric program which consists of the unconstrained convex function. Here, we develop the necessary duality equivalence between the two dual programs and show the computational attractiveness of our approach by consider a numerical example.