Finding the extreme efficient solutions of multi-objective pseudo-convex programming problem

Document Type : Original Article

Authors

Department of OR, Faculty of Mathematics, Shiraz University of Technology, Iran

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. 

Keywords

Main Subjects

References

[1] M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, John wiley & sons, New York, 2006.
[2] J. Y. Bello Cruz, L. R. Lucambio Perez, and J. G. Melo ´ , Convergence of the projected gradient method for quasiconvex multiobjective optimization, Nonlinear Anal., 74 (2011), pp. 5268–5273.
[3] H. P. Benson, Existence of efficient solutions for vector maximization problems, J. Optim. Theory Appl., 26 (1978), pp. 569–580.
[4] S. Boyd and L. Vandenberghe, Convex optimization, Cambridge University Press, Cambridge, 2004. 
[5] V. Chankong and Y. Y. Haimes, Multiobjective decision making, vol. 8 of North-Holland Series in System Science and Engineering, North-Holland Publishing Co., New York, 1983.
[6] A. Charnes and W. W. Cooper, Programming with linear fractional functionals, Nav. Res. Logist. Q., 9 (1962), pp. 181–186.
[7] M. Ehrgott, Multicriteria optimization, Springer-Verlag, Berlin, second ed., 2005.
[8] P. C. Gilmore and R. E. Gomory, A linear programming approach to the cutting stock problem–part ii, Oper. Res., 11 (1963), pp. 863–888.
[9] Y. Y. Haimes, L. S. Lasdon, and D. A. Wismer, On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE Transactions on Systems, Man, and Cybernetics, SMC-1 (1971), pp. 296–297.
[10] O. MANGASARIAN, Pseudo-convex functions, in Stochastic Optimization Models in Finance, W. ZIEMBA and R. VICKSON, eds., Academic Press, 1975, pp. 23–32.
[11] J. Matejaˇs and T. Peric´, A new iterative method for solving multiobjective linear programming problem, Appl. Math. Comput., 243 (2014), pp. 746–754.
[12] S. M. Mirdehghan and H. Rostamzadeh, Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique, J. Optim., (2016), pp. Art. ID 9175371, 8.
[13] H. Rostamzadeh and S. M. a. Mirdehghan, Finding the efficient solutions of multiobjective linear fractional programming problems with fuzzy coefficients in constraints and vector of resources, J. Oper. Res. Appl., 18 (2021), pp. 73–84.
[14] E. Valipour, M. A. Yaghoobi, and M. Mashinchi, An iterative approach to solve multiobjective linear fractional programming problems, Appl. Math. Model., 38 (2014), pp. 38–49.
[15] X. Zhao, M. A. Kobis, Y. Yao, and J.-C. Yao ¨ , A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems, J. Optim. Theory Appl., 190 (2021), pp. 82–107.
AUT Journal of Mathematics and Computing
Volume 6, Issue 1
January 2025
Pages 67-77

Files

Share

How to cite

Statistics