Special Issue on Algorithms and Models for Dynamic Multiple Criteria Decision Making

The authors proposed an extension of the Nelder–Mead simplex search algorithm to complete the matrix optimally by minimizing a maximum eigenvalue function subject to interval constraints and illustrating its applicability through several numerical simulations. The authors developed a multi-objective...

Full description

Saved in:
Bibliographic Details
Published inAlgorithms Vol. 14; no. 8; p. 233
Main Authors Di Caprio, Debora, Santos Arteaga, Francisco Javier
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.08.2021
Subjects
Algorithms
Case studies
Configurations
Conflicts of interest
Data envelopment analysis
Decision making
Design
Eigenvalues
Genetic algorithms
Mathematical models
Methods
Multiple criteria decision making
Multiple criterion
Multiple objective analysis
n/a
Optimization
Search algorithms
Online AccessGet full text

Cover

More Information
Summary:The authors proposed an extension of the Nelder–Mead simplex search algorithm to complete the matrix optimally by minimizing a maximum eigenvalue function subject to interval constraints and illustrating its applicability through several numerical simulations. The authors developed a multi-objective optimization methodology that implemented a genetic algorithm together with a set of parametric models designed to identify the best configuration that minimized interface loads, improving the efficiency of the deployment and configuration systems, while increasing the payload and reducing service costs. [...]we would like to thank Alina Chen and the editorial office of the journal for their efficient assistance in the publishing process.
Bibliography:SourceType-Scholarly Journals-1
content type line 14
ObjectType-Editorial-2
ObjectType-Commentary-1
ISSN:1999-4893
1999-4893
DOI:10.3390/a14080233