Add to ORKGWe establish necessary and su ¢ cient optimality condition for a class of nondi¤eren-tiable minimax fractional programming problems with square root terms involving (; ; )-invex funtions. Subsequently, we apply the optimality condition to formu-late a parametric dual problem and we prove weak duality, strong duality, and stric
AbstractBoth parametric and nonparametric necessary and sufficient optimality conditions are establi...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
AbstractIn the present paper, we discuss the optimality condition for an optimal solution to the pro...
Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming p...
ABSTRACT The Karush-Kuhn-Tucker type necessary optimality conditions are given for the nonsmooth min...
AbstractIn this paper, we are concerned with a nondifferentiable minimax fractional programming prob...
Abstract. We establish sufficient optimality conditions for a class of nondif-ferentiable minimax fr...
AbstractWe show that a minimax fractional programming problem is equivalent to a minimax nonfraction...
In this paper, a class of nonconvex nondifferentiable generalized minimax fractional programming pro...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
AbstractWe establish the necessary and sufficient optimality conditions for a class of nondifferenti...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
AbstractBoth parametric and nonparametric necessary and sufficient optimality conditions are establi...
AbstractThe Kuhn–Tucker-type necessary optimality conditions are given for the problem of minimizing...
AbstractBoth parametric and nonparametric necessary and sufficient optimality conditions are establi...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
AbstractIn the present paper, we discuss the optimality condition for an optimal solution to the pro...
Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming p...
ABSTRACT The Karush-Kuhn-Tucker type necessary optimality conditions are given for the nonsmooth min...
AbstractIn this paper, we are concerned with a nondifferentiable minimax fractional programming prob...
Abstract. We establish sufficient optimality conditions for a class of nondif-ferentiable minimax fr...
AbstractWe show that a minimax fractional programming problem is equivalent to a minimax nonfraction...
In this paper, a class of nonconvex nondifferentiable generalized minimax fractional programming pro...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
AbstractWe establish the necessary and sufficient optimality conditions for a class of nondifferenti...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
AbstractBoth parametric and nonparametric necessary and sufficient optimality conditions are establi...
AbstractThe Kuhn–Tucker-type necessary optimality conditions are given for the problem of minimizing...
AbstractBoth parametric and nonparametric necessary and sufficient optimality conditions are establi...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...