Implementation of the - Constraint Method in Special Class of Multi-objective Fuzzy Bi-Level Nonlinear Problems

Geometric programming problem is a powerful tool for solving some special type nonlinear programming problems. In the last few years we have seen a very rapid development on solving multiobjective geometric programming problem. A few mathematical programming methods namely fuzzy programming, goal pr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Pakistan journal of statistics and operation research Ročník 13; číslo 4; s. 739
Hlavní autor: Amer, Azza Hassan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Lahore University of the Punjab, College of Statistical & Actuarial Science 01.12.2017
Témata:
Duality theorem
Goal programming
Mathematical analysis
Mathematical programming
Multiple objective analysis
Nonlinear programming
Weighting methods
ISSN:1816-2711, 2220-5810
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Geometric programming problem is a powerful tool for solving some special type nonlinear programming problems. In the last few years we have seen a very rapid development on solving multiobjective geometric programming problem. 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 in bi-level multiobjective geometric programming problem to find the Pareto optimal solution at each level. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem at eash level. Here, we have developed a new algorithm for fuzzy programming technique to solve bi-level multiobjective geometric programming problems to find an optimal compromise solution. Finally the solution procedure of the fuzzy technique is illustrated by a numerical example
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1816-2711
2220-5810
DOI:10.18187/pjsor.v13i4.1698