×
Dar, Bilal Ahmad; Jayswal, Anurag; Singh, Deepak

Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems. (English) Zbl 1527.90233

Optimization 70, No. 5-6, 1275-1305 (2021).
Summary: This paper is developed to discuss the theoretical aspects of multiobjective fractional problems under interval uncertainty. For this, we have formulated an interval multiobjective fractional model (IVMFP) in which the numerator and denominator of objective functions are assumed to be interval valued functions. Partial ordering is invoked to define LU-Pareto optimal solutions to the problem. Thereafter, necessary optimality conditions of the Fritz John type and Kuhn Tucker type are derived in the classical way. LU-convexity and LU-concavity are used to establish the sufficient optimality criteria and with the same assumptions, the parametric duality theory is discussed. Also, interval valued vector Lagrangian is proposed and the corresponding results are established to locate the saddle point.

Cited in 4 Documents

MSC:

90C32 Fractional programming
90C29 Multi-objective and goal programming
90C46 Optimality conditions and duality in mathematical programming

Keywords:

interval-valued multiobjective fractional program; LU-Pareto optimal solution; necessary and sufficient optimality conditions; parametric duality; Lagrangian and saddle point
Cite Review PDF
Full Text: DOI

References:

[1] Debdulal, G.; Ghosh, D.; Bhuiya, SK, A saddle point characterization of efficient solutions for interval optimization problems, J Appl Math Comput, 58, 193-217 (2018) · Zbl 1401.90218
[2] Osuna-Gómez, R.; Hernández-Jiménez, B.; Chalco-Cano, Y., New efficiency conditions for multiobjective interval-valued programming problems, Inf Sci, 420, 235-248 (2017) · Zbl 1453.90151
[3] Singh, D.; Dar, BA; Kim, DS., Sufficiency and duality in non-smooth interval valued programming problems, J Ind Manag Optim, 15, 647-665 (2019) · Zbl 1438.90336
[4] Wu, HC., Solving the interval-valued optimization problems based on the concept of null set, J Ind Manag Optim, 14, 1157-1178 (2018) · Zbl 1412.90127
[5] Zhang, J.; Liu, S.; Li, L., The KKT optimality conditions in a class of generalized convex optimization problems with an interval valued objective function, Optim Lett, 8, 607-631 (2014) · Zbl 1317.90240
[6] Wu, HC., The Karush-Kuhn-Tucker optimality conditions in an optimization problem with interval-valued objective function, Euro J Oper Res, 176, 46-59 (2007) · Zbl 1137.90712
[7] Wu, HC., The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions, Euro J Oper Res, 196, 49-60 (2009) · Zbl 1190.90198
[8] Zhang, J., Optimality condition and wolfe duality for invex interval valued nonlinear programming problems, J Appl Math, 2013 (2013) · Zbl 1397.90367
[9] Chalco-Cano, Y.; Lodwick, WA; Rufian-Lizana, A., Optimality conditions of type KKT for optimization problem with interval valued objective function via generalized derivative, Fuzzy Optim Decis Making, 12, 305-322 (2013) · Zbl 1428.90189
[10] Singh, D.; Dar, BA; Kim, DS., KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions, Euro J Oper Res, 254, 29-39 (2016) · Zbl 1346.90752
[11] Li, L.; Liu, S.; Zhang, J., On fuzzy generalized convex mappings and optimality conditions for fuzzy weakly univex mappings, Fuzzy Sets Systems, 280, 107-132 (2015) · Zbl 1373.90180
[12] Li, L.; Zhang, J.; Zhou, C., Optimality conditions for interval-valued univex programming, J Inequal Appl, 1, 1-15 (2019) · Zbl 1499.90265
[13] Antczak, T., Optimality conditions and duality results for nonsmooth vector optimization problems with the multiple interval-valued objective function, Acta Math Sci, 37, 1133-1150 (2017) · Zbl 1399.90286
[14] Ghosh, D., Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions, J Appl Math Comput, 53, 709-731 (2017) · Zbl 1392.90106
[15] Ghosh, D., A quasi-Newton method with rank-two update to solve interval optimization problems, Int J Appl Comput Math, 3, 1719-1738 (2017) · Zbl 1397.90357
[16] Sun, Y.; Wang, L., Optimality conditions and duality in nondifferentiable interval-valued programming, J Ind Manage Optim, 9, 131-142 (2013) · Zbl 1263.90122
[17] Jayswal, A.; Stancu-Minasian, I.; Banerjee, J., Optimality conditions and duality for interval valued optimization problems using convexifactors, Rend Circ Mat Palermo, 65, 17-32 (2016) · Zbl 1338.90318
[18] Bhurjee, AK; Panda, G., Multi-objective interval fractional programming problems: an approach for obtaining efficient solutions, Opsearch, 52, 156-167 (2015) · Zbl 1332.90291
[19] Bhurjee, AK; Panda, G., Nonlinear fractional programming problem with inexact paremeter, J Appl Math Informatics, 31, 853-867 (2013) · Zbl 1304.90201
[20] Effati, S.; Pakdaman, M., Solving the interval-valued linear fractional programming problem, Am J Comput Math, 2, 51-55 (2012)
[21] Hladik, M., Generalized linear fractional programming under interval uncertainty, Euro J Oper Res, 205, 42-46 (2010) · Zbl 1187.90287
[22] Mrinal, J.; Geetanjali, P., Existence of χ-optimal solution of fractional programming problem with interval parameters, J Comput Sci Comput Math, 5, 27-32 (2015)
[23] Pal, BB; Moitra, BN; Sen, S., A linear goal programming approach to multiobjective fractional programming with interval parameter sets, Int J Math Oper Res, 3, 697-714 (2011) · Zbl 1390.90505
[24] Debnath, IP, Gupta, SK.Necessary and sufficient optimality conditions for fractional interval-valued optimization problems. In: Decision Science in Action. Singapore: Springer; 2019; p. 155-173. · Zbl 1456.90162
[25] Bazaraa, MS; Sherali, HD; Shetty, CM., Nonlinear programming (1993), New York (NY): Wiley, New York (NY) · Zbl 0774.90075
[26] Kanniappan, P., Necessary conditions for optimality of nondifferentiable convex multiobjective programming, J Optim Theory Appl, 40, 167-174 (1983) · Zbl 0488.49007
[27] Borwein, JM., Fractional programming without differentiability, Math Program, 11, 283-290 (1976) · Zbl 0357.90054
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.