A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research t...A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.展开更多
In this paper, we discuss a large number of sets of global parametric sufficient optimality conditions under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.
By a coincidence theorem, some existence theorems of solutions are proved for four types of generalized vector equilibrium problems with moving cones. Applications to the generalized semi-infinite programs with the ge...By a coincidence theorem, some existence theorems of solutions are proved for four types of generalized vector equilibrium problems with moving cones. Applications to the generalized semi-infinite programs with the generalized vector equilibrium constraints under the mild conditions are also given. The results of this paper unify and improve the corresponding results in the previous literature.展开更多
This paper considers a nonsmooth semi-infinite minimax fractional programming problem(SIMFP)involving locally Lipschitz invex functions.The authors establish necessary optimality conditions for SIMFP.The authors estab...This paper considers a nonsmooth semi-infinite minimax fractional programming problem(SIMFP)involving locally Lipschitz invex functions.The authors establish necessary optimality conditions for SIMFP.The authors establish the relationship between an optimal solution of SIMFP and saddle point of scalar Lagrange function for SIMFP.Further,the authors study saddle point criteria of a vector Lagrange function defined for SIMFP.展开更多
文摘A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.
文摘In this paper, we discuss a large number of sets of global parametric sufficient optimality conditions under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.
基金Project supported by the Key Program of the National Natural Science Foundation of China(NSFC)(No.70831005)the National Natural Science Foundation of China(Nos.11171237,11226228,and 11201214)+1 种基金the Science and Technology Program Project of Henan Province of China(No.122300410256)the Natural Science Foundation of Henan Education Department of China(No.2011B110025)
文摘By a coincidence theorem, some existence theorems of solutions are proved for four types of generalized vector equilibrium problems with moving cones. Applications to the generalized semi-infinite programs with the generalized vector equilibrium constraints under the mild conditions are also given. The results of this paper unify and improve the corresponding results in the previous literature.
基金supported by the Council of Scientific and Industrial Research(CSIR),New Delhi,India under Grant No.09/013(0474)/2012-EMR-1
文摘This paper considers a nonsmooth semi-infinite minimax fractional programming problem(SIMFP)involving locally Lipschitz invex functions.The authors establish necessary optimality conditions for SIMFP.The authors establish the relationship between an optimal solution of SIMFP and saddle point of scalar Lagrange function for SIMFP.Further,the authors study saddle point criteria of a vector Lagrange function defined for SIMFP.
