Finding the extreme efficient solutions of multi-objective pseudo-convex programming problem
Gespeichert in:
| Titel: | Finding the extreme efficient solutions of multi-objective pseudo-convex programming problem |
|---|---|
| Autoren: | Alireza Fakharzadeh Jahromi, Hassan Rostamzadeh |
| Quelle: | AUT Journal of Mathematics and Computing, Vol 6, Iss 1, Pp 67-77 (2025) |
| Verlagsinformationen: | Amirkabir University of Technology, 2025. |
| Publikationsjahr: | 2025 |
| Bestand: | LCC:Mathematics |
| Schlagwörter: | multi-objective programming, efficient solution, weakly efficient solution, pseudo-convex function, quasi-convex function, Mathematics, QA1-939 |
| Beschreibung: | In this paper, we present two methods to find the strictly efficient and weakly efficient points of multi-objective programming (MOP) problems in which their objective functions are pseudo-convex and their feasible sets are polyhedrons. The obtained efficient solutions in these methods are the extreme points. Since the pseudo-convex functions are quasi-convex as well, therefore the presented methods can be used to find efficient solutions of the (MOP) problem with the quasi-convex objective functions and the polyhedron feasible set. Two experimental examples are presented. |
| Publikationsart: | article |
| Dateibeschreibung: | electronic resource |
| Sprache: | English |
| ISSN: | 2783-2449 2783-2287 |
| Relation: | https://ajmc.aut.ac.ir/article_5280_0d9ee9705cd14bc33194430e1d3fc9fe.pdf; https://doaj.org/toc/2783-2449; https://doaj.org/toc/2783-2287 |
| DOI: | 10.22060/ajmc.2023.22132.1135 |
| Zugangs-URL: | https://doaj.org/article/18d114f52a004719b51e4101bf74b168 |
| Dokumentencode: | edsdoj.18d114f52a004719b51e4101bf74b168 |
| Datenbank: | Directory of Open Access Journals |
Nájsť tento článok vo Web of Science | Abstract: | In this paper, we present two methods to find the strictly efficient and weakly efficient points of multi-objective programming (MOP) problems in which their objective functions are pseudo-convex and their feasible sets are polyhedrons. The obtained efficient solutions in these methods are the extreme points. Since the pseudo-convex functions are quasi-convex as well, therefore the presented methods can be used to find efficient solutions of the (MOP) problem with the quasi-convex objective functions and the polyhedron feasible set. Two experimental examples are presented. |
|---|---|
| ISSN: | 27832449 27832287 |
| DOI: | 10.22060/ajmc.2023.22132.1135 |