Geometric programming problem with single-term exponents subject to max-product fuzzy relational equations

In this paper, an optimization model for minimizing an objective function with single-term exponents subject to fuzzy relational equations specified in max-product composition is presented. The solution set of such a fuzzy relational equation is a non-convex set. First, we present some properties fo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical and computer modelling Jg. 53; H. 1; S. 55 - 62
Hauptverfasser: Zhou, XueGang, Ahat, Rashida
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Kidlington Elsevier Ltd 2011
Elsevier
Schlagworte:
Calculus of variations and optimal control
Convex and discrete geometry
equations
Exact sciences and technology
Fuzzy optimization
Fuzzy relational equations
Geometric programming
Geometry
Mathematical analysis
Mathematics
Max-product composition
Methods of scientific computing (including symbolic computation, algebraic computation)
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in mathematical programming, optimization and calculus of variations
Numerical methods in optimization and calculus of variations
Sciences and techniques of general use
system optimization
Fuzzy relational equations
Fuzzy optimization
Max-product composition
Geometric programming
Convex set
Optimization method
Numerical analysis
Applied mathematics
Optimal solution
Variational calculus
Mathematical model
Computer aided analysis
Mathematical programming
ISSN:0895-7177, 1872-9479
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, an optimization model for minimizing an objective function with single-term exponents subject to fuzzy relational equations specified in max-product composition is presented. The solution set of such a fuzzy relational equation is a non-convex set. First, we present some properties for the optimization problem under the assumptions of both negative and nonnegative exponents in the objective function. Second, an efficient procedure is developed to find an optimal solution without looking for all the potential minimal solutions and without using the value matrix. An example is provided to illustrate the procedure.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0895-7177
1872-9479
DOI:10.1016/j.mcm.2010.07.018