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 programming code. Some examples and computational experience are given.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.