A note on a paper by E. Khorram and A. Ghodousian

The aim of this short note is to show on a numerical example that one of the two optimization algorithms proposed in [E. Khorram, A. Ghodousian, Linear objective function optimization with fuzzy relation equation constraints regarding max-av composition, Appl. Math. Comput. 173 (2006) 872–886] may n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied mathematics and computation Jg. 188; H. 1; S. 244 - 245
1. Verfasser: Zimmermann, Karel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY Elsevier Inc 01.05.2007
Elsevier
Schlagworte:
Calculus of variations and optimal control
Exact sciences and technology
Fuzzy relation equations
Mathematical analysis
Mathematics
Non-convex optimization
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in mathematical programming, optimization and calculus of variations
Optimization with linear objective function
Sciences and techniques of general use
Fuzzy relation equations
Optimization with linear objective function
Non-convex optimization
Numerical analysis
Applied mathematics
Optimal solution
Optimization method
Algorithm
Mathematical programming
ISSN:0096-3003, 1873-5649
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The aim of this short note is to show on a numerical example that one of the two optimization algorithms proposed in [E. Khorram, A. Ghodousian, Linear objective function optimization with fuzzy relation equation constraints regarding max-av composition, Appl. Math. Comput. 173 (2006) 872–886] may not lead to the optimal solution in some cases. Besides it will be pointed out that the other algorithm (correct, but unfortunately ineffective for larger problems) proposed in [E. Khorram, A. Ghodousian, Linear objective function optimization with fuzzy relation equation constraints regarding max-av composition, Appl. Math. Comput. 173 (2006) 872–886] can be extended to a wider class of non-convex optimization problems.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2006.07.167