EUVIMEDEUVIMED entdecken
Crossref

A comparative study of two key algorithms in multiple objective linear programming

Paschal B Nyiam, Abdellah Salhi

Journal of Algorithms & Computational Technology · 2019-01 · 13

DOI: 10.1177/1748302619870424 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algorithms & Computational Technology, online erschienen am 22.10.2019. Verfasst von Paschal B Nyiam und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 33 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Multiple objective linear programming problems are solved with a variety of algorithms. While these algorithms vary in philosophy and outlook, most of them fall into two broad categories: those that are decision space-based and those that are objective space-based. This paper reports the outcome of a computational investigation of two key representative algorithms, one of each category, namely the parametric simplex algorithm which is a prominent representative of the former and the primal variant of Bensons Outer-approximation algorithm which is a prominent representative of the latter. The paper includes a procedure to compute the most preferred nondominated point which is an important feature in the implementation of these algorithms and their comparison. Computational and comparative results on problem instances ranging from small to medium and large are provided.

Zitieren

APA

Nyiam, P. B., & Salhi, A. (2019). A comparative study of two key algorithms in multiple objective linear programming. Journal of Algorithms & Computational Technology, 13. https://doi.org/10.1177/1748302619870424

Vancouver

Nyiam PB, Salhi A. A comparative study of two key algorithms in multiple objective linear programming. Journal of Algorithms & Computational Technology. 2019;13. doi:10.1177/1748302619870424

BibTeX
@article{Nyiam2019,
  author = {Nyiam, Paschal B and Salhi, Abdellah},
  title = {A comparative study of two key algorithms in multiple objective linear programming},
  journal = {Journal of Algorithms & Computational Technology},
  year = {2019},
  volume = {13},
  doi = {10.1177/1748302619870424}
}
Kostenlos starten →