On Second-Order Duality for Minimax Fractional Programming Problems with Generalized Convexity
نویسنده
چکیده
and Applied Analysis 3 K x { ( s, t, ỹ ) ∈ N × R × R : 1 ≤ s ≤ n 1, t t1, t2, . . . , ts ∈ R
منابع مشابه
Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
*Correspondence: [email protected] Department of Mathematics, University of Tabuk, Tabuk, Kingdom of Saudi Arabia Abstract In the present paper, we are concerned with second-order duality for nondifferentiable minimax fractional programming under the second-order generalized convexity type assumptions. The weak, strong and converse duality theorems are proved. Results obtained in this paper ext...
متن کاملOptimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity1
We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.
متن کاملHigher-Order Duality for Minimax Fractional Type Programming Involving Symmetric Matrices
Convexity and generalized convexity play important roles in optimization theory. With the development of programming problem, there has been a growing interest in the higher-order dual problem and a lot of related generalized convexities are given. In this paper, we give the convexity of ( , , , , , ) F d b vector-pseudoquasi-Type I and formulate a higher-order duality for minimax fract...
متن کاملSecond-Order Duality for Nondifferentiable Minimax Fractional Programming Involving (F, ρ)-Convexity
We focus our study to formulate two different types of second-order dual models for a nondifferentiable minimax fractional programming problem and derive duality theorems under (F, ρ)-convexity. Several results including many recent works are obtained as special cases.
متن کاملDuality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,ρ,d)-Convexity
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involved functions are locally Lipschitz. Furthermore, weak, strong and strict converse duality theorems are proved in the setting of Mond-Weir type dual under the assumption of generalized (F,α,ρ,d)-convexity.
متن کامل