A simple primal solution method for geometric programming is proposed. The method exploits the proximity of geometric and linear programming and is easy to implement by anyone having a linear ...
This paper concerns a method for digital circuit optimization based on formulating the problem as a geometric program (GP) or generalized geometric program (GGP), which can be transformed to a convex ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback