Add to ORKGIn this paper, we discuss a fairly large number of sets of global parametric sufficient optimality conditions under various generalized (α, η, ρ)-V-invexity assumptions for a semiinfinite discrete minmax fractional programming prob-lem
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
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...
We first define a new class of generalized convex n-set functions, called (,b,φ,ρ,θ)-univex function...
First several new classes of higher order (φ, η, ω, π, ρ, θ, m)-invexities are introduced, and then ...
First, a class of second order hybrid (Pdbl, ζ, ρ, θ, m)-invexities is introduced, and then a set of...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
Abstract. A discrete minmax fractional subset programming problem is considered. Various parametric ...
AbstractWe establish the sufficient conditions for generalized fractional programming in the framewo...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
ABSTRACT The Karush-Kuhn-Tucker type necessary optimality conditions are given for the nonsmooth min...
ABSTRACT The Karush-Kuhn-Tucker type necessary optimality conditions are given for the nonsmooth min...
We construct three parametric duality models and establish a fairly large number of dual-ity results...
AbstractIn this paper, we present numerous sets of nonparametric sufficient optimality conditions an...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
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...
We first define a new class of generalized convex n-set functions, called (,b,φ,ρ,θ)-univex function...
First several new classes of higher order (φ, η, ω, π, ρ, θ, m)-invexities are introduced, and then ...
First, a class of second order hybrid (Pdbl, ζ, ρ, θ, m)-invexities is introduced, and then a set of...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
Abstract. A discrete minmax fractional subset programming problem is considered. Various parametric ...
AbstractWe establish the sufficient conditions for generalized fractional programming in the framewo...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive dua...
ABSTRACT The Karush-Kuhn-Tucker type necessary optimality conditions are given for the nonsmooth min...
ABSTRACT The Karush-Kuhn-Tucker type necessary optimality conditions are given for the nonsmooth min...
We construct three parametric duality models and establish a fairly large number of dual-ity results...
AbstractIn this paper, we present numerous sets of nonparametric sufficient optimality conditions an...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
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...