Finding the extreme efficient solutions of multi-objective pseudo-convex programming problem
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 extre...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Amirkabir University of Technology
2025-01-01
|
| Series: | AUT Journal of Mathematics and Computing |
| Subjects: | |
| Online Access: | https://ajmc.aut.ac.ir/article_5280_0d9ee9705cd14bc33194430e1d3fc9fe.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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: | 2783-2449 2783-2287 |