Абстрактный

MULTI - OBJECTIVE GEOMETRIC PROGRAMMING AND ITS APPLICATION IN GRAVEL BOX PROBLEM

Pintu Das and Tapan Kumar Roy

Multi-objective geometric programming (MOGP) is a strong tool for solving a type of optimization problem. This paper develops a solution procedure to solve a multi-objective non-linear programming problem using MOGP technique based on weighted-sum method, weighted-product method and weighted min-max method .The equivalent general Multi-objective geometric programming problems are formulated to find their corresponding value of the objective functions based on duality theorem. As the numerical example Gravel- box design problem is presented to illustrate the methods.