This issue
Previous Article
New approach to global minimization of normal multivariate polynomial based on tensor
Next Article
New adaptive stepsize selections in gradient methods
Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs
-
Abstract
In this paper, a class of nondifferentiable multiobjective fractional programs is studied, in which every component of the objective function contains a term involving the support function of a compact convex set. Kuhn-Tucker necessary and sufficient optimality conditions, duality and saddle point results for weakly efficient solutions of the nondifferentiable multiobjective fractional programming problems are given. The results presented in this paper improve and extend some the corresponding results in the literature.-
Keywords:
- Nondifferentiable multiobjective fractional programming,
- Kuhn-Tucker optimality condition,
- duality,
- saddle point,
- weakly efficient solution,
- $(F,
- \alpha,
- \rho,
- d)$-convex function.
Mathematics Subject Classification: Primary: 90C26, 90C29; Secondary: 90C46.Citation: -
Access History