A hybrid method for solving multi-objective geometric programming problem

Abstract

A multi-objective geometric programming problem contains more than one objective that needs to be achieved simultaneously. Such problems arise in many applications where two or more, sometimes conflicting objective functions have to be minimised concurrently. In this paper a new adaptive strategy called hybrid method proposed to find Pareto optimal solutions of the multi-objective geometric programming problem. Using geometric programming technique, a global best optimal solution is obtained from a set of Pareto optimal solution having a great impact on convergence of solution. The discussed hybrid method having a goal to enhance the optimisers over all performance by combining different optimisation techniques. In the proposed method we have combined ?-constraint and weighted mean method and finally the result so obtained compared with the result obtained by fuzzy programming method. The solution procedure of the proposed hybrid method is illustrated by the numerical examples. Copyright � 2015 Inderscience Enterprises Ltd.