AbstractOptimality conditions are proved for a class of generalized fractional minimax programming problems involving B-(p,r)-invexity functions. Subsequently, these optimality conditions are utilized as a basis for constructing various duality models for this type of fractional programming problems and proving appropriate duality theorems
Abstract: In this paper, we discuss nondifferentiable minimax fractional programming problem where t...
AbstractIn the present paper, we discuss the optimality condition for an optimal solution to the pro...
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involve...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
AbstractUnder different forms of invexity conditions, sufficient Kuhn–Tucker conditions and three du...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming p...
In this paper, a class of nonconvex nondifferentiable generalized minimax fractional programming pro...
AbstractA sufficient optimality theorem is proved for a certain minmax programming problem under the...
AbstractWe establish the necessary and sufficient optimality conditions for a class of nondifferenti...
AbstractWe establish the sufficient conditions for generalized fractional programming in the framewo...
The convexity assumptions for a minimax fractional programming problem of variational type are relax...
AbstractWe establish the sufficient conditions for generalized fractional programming from a viewpoi...
AbstractIn this paper, a generalized ratio invexity concept has been applied for single objective fr...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
Abstract: In this paper, we discuss nondifferentiable minimax fractional programming problem where t...
AbstractIn the present paper, we discuss the optimality condition for an optimal solution to the pro...
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involve...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
AbstractUnder different forms of invexity conditions, sufficient Kuhn–Tucker conditions and three du...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming p...
In this paper, a class of nonconvex nondifferentiable generalized minimax fractional programming pro...
AbstractA sufficient optimality theorem is proved for a certain minmax programming problem under the...
AbstractWe establish the necessary and sufficient optimality conditions for a class of nondifferenti...
AbstractWe establish the sufficient conditions for generalized fractional programming in the framewo...
The convexity assumptions for a minimax fractional programming problem of variational type are relax...
AbstractWe establish the sufficient conditions for generalized fractional programming from a viewpoi...
AbstractIn this paper, a generalized ratio invexity concept has been applied for single objective fr...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
Abstract: In this paper, we discuss nondifferentiable minimax fractional programming problem where t...
AbstractIn the present paper, we discuss the optimality condition for an optimal solution to the pro...
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involve...
DOI
Add to ORKG