A hybrid method for solving multi-objective geometric programming problem

A.K. Ojha and Rashmi Ranjan Ota

International Journal of Mathematics in Operational Research, 2015, vol. 7, issue 2, 119-137

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.

Keywords: multi-objective geometric programming; epsilon-constraint; weighted mean; optimisation; fuzzy programming. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=68288 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:7:y:2015:i:2:p:119-137

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().