Abstract
The aim of this study is to present an alternative approach for solving the multi-objective posynomial geometric programming problems. The proposed approach minimizes the weighted objective function comes from multi-objective geometric programming problem subject to constraints which constructed by using Kuhn-Tucker Conditions. A new nonlinear problem formed by this approach is solved iteratively. The solution of this approach gives the Pareto optimal solution for the multi-objective posynomial geometric programming problem. To demonstrate the performance of this approach, a problem which was solved with a weighted mean method by Ojha and Biswal (2010) is used. The comparison of solutions between two methods shows that similar results are obtained. In this manner, the proposed approach can be used as an alternative of weighted mean method.