Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints

Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data

“…Remark 4.2 Clearly, if = 0 and V t , t ∈ T , are singletons, the -weakly efficient solution of (OMD) reduces to the usual weakly efficient solution of the corresponding deterministic optimization problem. For more details, see [12,14].…”

“…It is an active research topic over the last several decades due to a wide range of applications in different fields of engineering and economics. There are many papers devoted to the investigation of fractional optimization problems from several different perspectives; see, e.g., [1][2][3][4][5][6][7][8][9][10][11][12][13][14] and the references therein.…”

“…Chuong [12] established optimality conditions and duality theorems for nondifferentiable fractional semi-infinite multiobjective optimization problems. More recently, some results on optimality and duality for a nonsmooth and nonconvex multiobjective fractional programming problem are obtained in [14] in terms of contingent derivatives. However, in contrast to the deterministic case, it appears that there exist few papers in the literature devoting to the study of multiobjective fractional optimization problems with uncertain data, see [23].…”