پیوندهای مفید
آمار
| تعداد نشریات | 32 |
| تعداد شمارهها | 861 |
| تعداد مقالات | 8,363 |
| تعداد مشاهده مقاله | 53,002,442 |
| تعداد دریافت فایل اصل مقاله | 9,366,024 |
Improved feasible value constraint for multiobjective optimization problems | ||
| Journal of Mathematical Modeling | ||
| مقاله 19، دوره 13، شماره 1، خرداد 2025، صفحه 105-120 اصل مقاله (189.39 K) | ||
| نوع مقاله: Research Article | ||
| شناسه دیجیتال (DOI): 10.22124/jmm.2024.28044.2469 | ||
| نویسندگان | ||
| Hossein Salmei* ؛ Mehran Namjoo | ||
| Department of Mathematics, Vali-e-Asr University of Rafsanjan, Rafsanjan, Iran | ||
| چکیده | ||
| In this paper, we focus on the utilization of the feasible value constraint technique to address multiobjective optimization problems (MOPs). It is attempted to overcome certain drawbacks associated with this method, such as restrictions on functions and weights, inflexibility in constraints, and challenges in assessing proper efficiency. To accomplish this, we propose an improved version of the feasible value constraint technique. Then, by incorporating approximate solutions, we establish connections between $\varepsilon$-(weakly, properly) efficient points in a general MOP and $\epsilon$-optimal solutions to the scalarization problem. | ||
| کلیدواژهها | ||
| Multiobjective optimization problem؛ Feasible value constraint technique؛ Scalarization techniques؛ $\varepsilon$-(weakly؛ properly) efficient solutions | ||
| مراجع | ||
|
[1] J. Branke, K. Deb, K. Miettinen, R. Sowiski, Multiobjective Optimization Interactive and Evolu- tionary Approaches, Springer, Berlin, 2008. [2] R.S. Burachik, C.Y. Kaya, M.M. Rizvi, A new scalarization technique and new algorithms to gen- erate Pareto fronts, SIAM J. Optim. 27 (2017) 1010–1034. [3] R.S. Burachik, C. Y. Kaya, M.M. Rizvi, A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets, J. Optim. Theory Appl. 162 (2014) 428–446. [4] M. Ehrgott, Multicriteria Optimization, Berlin, Springer, 2005. [5] M. Ehrgott, K. Klamroth, C. Schwehm, An MCDM approach to portfolio optimization, Eur. J. Oper. Res. 155 (2004) 752–770. [6] M. Ehrgott, S. Ruzika, Improved ε-constraint method for multiobjective programming, J. Optim. Theory Appl. 138 (2008) 375–396. [7] G. Eichfelder, Adaptive Scalarization Methods in Multiobjective Optimization, Berlin, Springer, 2008. [8] G. Eichfelder, Scalarizations for adaptively solving multi-objective optimization problems, Com- put. Optim. Appl. 44 (2009) 249–273. [9] A. Engau, M. Wiecek, Generating epsilon efficient solutions in multiobjective programming, Eur. J. Oper. Res. 177 1566–1579. [10] Y. Gao, X. Yang, K.L. Teo, Optimality conditions for approximate solutions in vector optimization problems, J. Ind. Manag. Optim. 7 (2011) 483–496. [11] A.M. Geoffrion, Proper efficiency and the theory of vector maximization, J. Optim. Theory Appl. 22 (1968) 618–630. [12] C. Hillermeier, J. Jahn, Multiobjective optimization, survey of methodsand industrial applications, Surv. Math. Ind. 11 (2005) 1–42. [13] R.A. Horn, C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, 1991. [14] A. Hutterer, J. Jahn, On the location of antennas for treatment planning in hyperthermia, OR Spec- trum. 25 (2003) 397–412. [15] J. Jahn, Vector optimization: Theory, applications and extensions, Berlin, Springer, 2004. [16] J. Jahn, A. Kirsch, C. Wagner, Optimization of rod antennas of mobile phones, Math. Methods Oper. Res. 59 (2004) 37–51. [17] K. Khaledian, E. Khorram, B. Karimi, Characterizing ε- properly efficient solutions, Optim. Meth- ods Softw. 30 (2014) 583–593. [18] S.S. Kutateladze, Convex ε-programming, Soviet Math. Dokl. 20 (1979) 391–393. [19] P. Loridan, ε-Solutions in vector minimization problems, J. Optim. Theory Appl. 43 (1984) 265– 276. [20] R.T. Marler, J.S. Arora, Survey of multi-objective optimization methods for engineering, Struct, Multidiscip. Optim. 26 (2004) 369–395. [21] N. Rastegar, E. Khorram, A combined scalarizing method for multiobjective programming prob- lems, Eur. J. Oper. Res. 236 (2014) 229–237. [22] M.M. Rizvi, New optimality conditions for non-linear multiobjective optimization problems and new scalarization techniques for constructing pathological Pareto fronts, PhD Thesis, University of South Australia, 2013. [23] F. Ruiz, L. Rey, M.M. Munoz, A graphical characterization of the efficient set for convex multiob- jective problems, Ann. Oper. Res. 164 (2008) 115–126. [24] H. Salmei, M.A. Yaghoobi,Improving the min-max method for multiobjective programming, Oper. Res. Lett. 48 (2020) 480–486. [25] L. Shao, M. Ehrgott, Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning, Math. Methods Oper. Res. 68 (2008) 257– 276. [26] L. Shao, M. Ehrgott, Approximating the nondominated set of an MOLP by approximately solving its dual problem, Math. Methods Oper. Res. 68 (2008) 469–492. [27] R.E. Steuer, P. Na, Multiple criteria decision making combined with finance: A categorized biblio- graphic study, Eur. J. Oper. Res. 150 (2003) 496–515. [28] M. Soleimani-Damaneh, An optimization modelling for string selection in molecular biology using Pareto optimality, Appl. Math. Model. 35 (2011) 3887–3892. [29] H. Tuy, Convex Analysis and Global Optimization, Berline, Springer, 2016. [30] D.J. White, Epsilon-dominating solutions in mean-variance portfolio analysis, Eur. J. Oper. Res. 105 (1998) 457–466. [31] D.J. White, A bibliography on the application of mathematical programming multiple-objective methods, J. Oper. Res. Soc. 41 (1990) 669–691. | ||
|
آمار تعداد مشاهده مقاله: 289 تعداد دریافت فایل اصل مقاله: 303 |
||