Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-05T22:29:50.048Z Has data issue: false hasContentIssue false

Multi-objective geometric programming problem withKarush−Kuhn−Tucker condition using ϵ-constraintmethod

Published online by Cambridge University Press:  10 June 2014

A.K. Ojha
Affiliation:
School of Basic Sciences, Indian Institute of Technology, Bhubaneswar, 751013 Bhubaneswar, Odisha, India.. akojha57@yahoo.com; akojha@iitbbs.ac.in
Rashmi Ranjan Ota
Affiliation:
Department of Mathematics, ITER, SOA University, 751030 Bhubaneswar, Odisha, India.; otamath@yahoo.co.in

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Optimization is an important tool widely used in formulation of the mathematical modeland design of various decision making problems related to the science and engineering.Generally, the real world problems are occurring in the form of multi-criteria andmulti-choice with certain constraints. There is no such single optimal solution existwhich could optimize all the objective functions simultaneously. In this paper,ϵ-constraint method along with Karush−Kuhn−Tucker (KKT) condition has been used tosolve multi-objective Geometric programming problems(MOGPP) for searching a compromisesolution. To find the suitable compromise solution for multi-objective Geometricprogramming problems, a brief solution procedure using ϵ-constraint method hasbeen presented. The basic concept and classical principle of multi-objective optimizationproblems with KKT condition has been discussed. The result obtained by ϵ-constraint method withhelp of KKT condition has been compared with the result so obtained by Fuzzy programmingmethod. Illustrative examples are presented to demonstrate the correctness of proposedmodel.

Information

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI 2014