AbstractIn this paper, Lagrange multiplier theorems are developed for the multiobjective fractional programming problem involving n-set functions. A Lagrange dual is introduced and duality results in terms of efficient solutions are established
Fractional program is an optimization of objective function in the form of rational function. If onl...
AbstractA new method is used for solving nonlinear multiobjective fractional programming problems ha...
AbstractNecessary and sufficient optimality conditions are obtained for a nonlinear fractional multi...
AbstractIn this paper, Lagrange multiplier theorems are developed for the multiobjective fractional ...
AbstractIn the present paper we consider a class of multiobjective fractional programming problems i...
AbstractIn the present paper we consider a class of multiobjectiveB-vex programming problems involvi...
AbstractWe consider a multiobjective fractional programming problem (MFP) involving vector-valued ob...
AbstractIn this paper we present four sets of saddle-point-type optimality conditions, construct two...
AbstractIn this paper, generalizing the concept of cone convexity, we have defined cone preinvexity ...
AbstractA new method is used for solving nonlinear multiobjective fractional programming problems ha...
AbstractIn this paper, we first introduce a new class of generalized convex n-set functions, called ...
AbstractThis paper is concerned with the study of necessary and sufficient optimality conditions for...
AbstractA minmax programming problem involving severalB-vexn-set functions is considered. Necessary ...
AbstractAn incomplete Lagrange function is introduced for a class of nonlinear programming problems ...
We establish duality results under generalized convexity assumptions for a multiobjective nonlinear ...
Fractional program is an optimization of objective function in the form of rational function. If onl...
AbstractA new method is used for solving nonlinear multiobjective fractional programming problems ha...
AbstractNecessary and sufficient optimality conditions are obtained for a nonlinear fractional multi...
AbstractIn this paper, Lagrange multiplier theorems are developed for the multiobjective fractional ...
AbstractIn the present paper we consider a class of multiobjective fractional programming problems i...
AbstractIn the present paper we consider a class of multiobjectiveB-vex programming problems involvi...
AbstractWe consider a multiobjective fractional programming problem (MFP) involving vector-valued ob...
AbstractIn this paper we present four sets of saddle-point-type optimality conditions, construct two...
AbstractIn this paper, generalizing the concept of cone convexity, we have defined cone preinvexity ...
AbstractA new method is used for solving nonlinear multiobjective fractional programming problems ha...
AbstractIn this paper, we first introduce a new class of generalized convex n-set functions, called ...
AbstractThis paper is concerned with the study of necessary and sufficient optimality conditions for...
AbstractA minmax programming problem involving severalB-vexn-set functions is considered. Necessary ...
AbstractAn incomplete Lagrange function is introduced for a class of nonlinear programming problems ...
We establish duality results under generalized convexity assumptions for a multiobjective nonlinear ...
Fractional program is an optimization of objective function in the form of rational function. If onl...
AbstractA new method is used for solving nonlinear multiobjective fractional programming problems ha...
AbstractNecessary and sufficient optimality conditions are obtained for a nonlinear fractional multi...
DOI
Add to ORKG