This thesis studies the properties of posynomial geometric programming. De-tailed proofs are given to support methods for solving these types of geometric programming problems. In addition, a process for a postoptimal analysis is given. Based on these results, an inventory theory model is solved.
