अमूर्त

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.

अस्वीकृति: इस सारांश का अनुवाद कृत्रिम बुद्धिमत्ता उपकरणों का उपयोग करके किया गया है और इसे अभी तक समीक्षा या सत्यापित नहीं किया गया है।

में अनुक्रमित

Google Scholar
Academic Journals Database
Open J Gate
Academic Keys
ResearchBible
CiteFactor
Electronic Journals Library
RefSeek
Hamdard University
Scholarsteer
International Innovative Journal Impact Factor (IIJIF)
International Institute of Organised Research (I2OR)
Cosmos

और देखें