Optimizing the geometric programming problem with single-term exponents subject to max–min fuzzy relational equation constraints

In this study we investigate the problem of minimizing an objective function with single-term exponents subject to fuzzy relational equations specified in max–min composition. Two folds are presented. First, we present some properties for this optimization problem under the assumption of both negati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical and computer modelling Jg. 47; H. 3; S. 352 - 362
1. Verfasser: Wu, Yan-Kuen
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Elsevier Ltd 01.02.2008
Elsevier Science
Schlagworte:
Calculus of variations and optimal control
Exact sciences and technology
Fuzzy optimization
Fuzzy relational equations
Geometric programming
Mathematical analysis
Mathematics
Max–min 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
Sciences and techniques of general use
Fuzzy relational equations
Fuzzy optimization
Max–min composition
Geometric programming
Numerical analysis
Scientific computation
Applied mathematics
Optimization method
Mathematical model
Max-min composition
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 study we investigate the problem of minimizing an objective function with single-term exponents subject to fuzzy relational equations specified in max–min composition. Two folds are presented. First, we present some properties for this optimization problem under the assumption of both negative and nonnegative exponents in the objective function. Second, we provide an efficient procedure to solve this optimization problem without looking for all the potential minimal solutions. Two concrete examples are provided to illustrate the procedure.
ISSN:0895-7177
1872-9479
DOI:10.1016/j.mcm.2007.04.010