Modified Geometric Programming Problem and Its Applications

@inproceedings{IslamModifiedGP,
  title={Modified Geometric Programming Problem and Its Applications},
  author={Sahidul Islam and Tapan Kumar Roy}
}
In this paper, we propose unconstrained and constrained posynomial Geometric Programming (GP) problem with negative or positive integral degree of difficulty. Conventional GP approach has been modified to solve some special type of GP problems. In specific case, when the degree of difficulty is negative, the normality and the orthogonality conditions of the dual program give a system of linear equations. No general solution vector exists for this system of linear equations. But an approximate… CONTINUE READING