In this paper,we emphasize on a nondifferentiable minimax fractional programming(NMFP)problem and obtain appropriate duality results for higher-order dual model under higher-order B-(p,r)-invex functions.We provide a ...In this paper,we emphasize on a nondifferentiable minimax fractional programming(NMFP)problem and obtain appropriate duality results for higher-order dual model under higher-order B-(p,r)-invex functions.We provide a nontrivial illustration of a function which belongs to the class of higher-order B-(p,r)-invex but not in the class of second-order B-(p,r)-invex functions already existing in literature.An example of finding a minimax solution of NMFP problem by using higher-order B-(p,r)-invex functions has also been given.Various known results are discussed as particular cases.展开更多
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 gen...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, α ,p ,d ,b , φ )β vector-pseudo- quasi-Type I and formulate a higher-order duality for minimax fractional type programming involving symmetric matrices, and give the weak, strong and strict converse duality theorems under the condition of higher-order (F, α ,p ,d ,b , φ )β vector-pseudoquasi-Type I.展开更多
文摘In this paper,we emphasize on a nondifferentiable minimax fractional programming(NMFP)problem and obtain appropriate duality results for higher-order dual model under higher-order B-(p,r)-invex functions.We provide a nontrivial illustration of a function which belongs to the class of higher-order B-(p,r)-invex but not in the class of second-order B-(p,r)-invex functions already existing in literature.An example of finding a minimax solution of NMFP problem by using higher-order B-(p,r)-invex functions has also been given.Various known results are discussed as particular cases.
文摘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, α ,p ,d ,b , φ )β vector-pseudo- quasi-Type I and formulate a higher-order duality for minimax fractional type programming involving symmetric matrices, and give the weak, strong and strict converse duality theorems under the condition of higher-order (F, α ,p ,d ,b , φ )β vector-pseudoquasi-Type I.
