Geometric programming and dual entropy-optimization problem

Geometric programming and dual entropy-optimization problem

0.00 Avg rating0 Votes
Article ID: iaor20084128
Country: Netherlands
Volume: 193
Issue: 2
Start Page Number: 340
End Page Number: 345
Publication Date: Nov 2007
Journal: Applied Mathematics and Computation
Authors: ,
Keywords: programming: convex
Abstract:

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 considering a numerical example.

Reviews

Required fields are marked *. Your email address will not be published.