Multi-objective geometric programming problem with ∊-constraint method

In multi-objective geometric programming problem there are more than one objective functions. There is no single optimal solution which simultaneously optimizes all the objective functions. Under these conditions the decision makers always search for the most “preferred” solution, in contrast to the optimal solution. A few mathematical programming methods namely fuzzy programming, goal programming and weighting methods have been applied in the recent past to find the compromise solution. In this paper ∊∊-constraint method has been applied to find the non-inferior solution. A brief solution procedure of ∊∊-constraint method has been presented to find the non-inferior solution of the multi-objective programming problems. Further, the multi-objective programming problems is solved by the fuzzy programming technique to find the optimal compromise solution. Finally, two numerical examples are solved by both the methods and compared with their obtained solutions.