The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unif...The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly.展开更多
A class of functions called quasi B s invex and pseudo B s invex functions are introduced by using the concept of symmetric gradient. The examples of quasi B s invex and pseudo B s invex functions are given. The suffi...A class of functions called quasi B s invex and pseudo B s invex functions are introduced by using the concept of symmetric gradient. The examples of quasi B s invex and pseudo B s invex functions are given. The sufficient optimality conditions and Mond Weir type duality results are obtained for a nondifferentiable nonlinear semi infinite programming problem involving quasi B s invex and pseudo B s invex functions.展开更多
The aim of this article is to discuss an asymptotic approximation model and its convergence for the minimax semi-infinite programming problem. An asymptotic surrogate constraints method for the minimax semi-infinite p...The aim of this article is to discuss an asymptotic approximation model and its convergence for the minimax semi-infinite programming problem. An asymptotic surrogate constraints method for the minimax semi-infinite programming problem is presented by making use of two general discrete approximation methods. Simultaneously, the consistence and the epi-convergence of the asymptotic approximation problem are discussed.展开更多
In this paper, we present several parametric duality results under various generalized （a,v,p）-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized （a,n, p）-V-invexity assumptions for a semiinfinite multiobjective fractional programmi...Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized （a,n, p）-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.展开更多
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.展开更多
The convergence of the maximum entropy method of nonsmooth semi-infinite programmings is proved, and the stability and the strong stability of the method are discussed.
In this paper, we study optimal value functions of generalized semi-infinite min-max programming problems on a noncompact set. Directional derivatives and subdifferential characterizations of optimal value functions a...In this paper, we study optimal value functions of generalized semi-infinite min-max programming problems on a noncompact set. Directional derivatives and subdifferential characterizations of optimal value functions are given. Using these properties,we establish first order optimality conditions for unconstrained generalized semi-infinite programming problems.展开更多
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.
This paper presents a new method, called the maximum entropy method,for solving semi-infinite programming problems, in which the semi-infinite programmingproblem is approximated by one with a single constraint. The co...This paper presents a new method, called the maximum entropy method,for solving semi-infinite programming problems, in which the semi-infinite programmingproblem is approximated by one with a single constraint. The convergence properties forthis method are discussed. Numerical examples are given to show the high effciency of thealgorithm.展开更多
基金Supported by the Science Foundation of Shaanxi Provincial Educational Department Natural Science Foundation of China（06JK152） Supported by the Graduate Innovation Project of Yanan uni- versity（YCX201003）
文摘The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly.
基金the Natural Science Foundation of Shaanxi Province and the Science Foundation of Shaanxi Provincial Educational CommitteeP.R.China
文摘A class of functions called quasi B s invex and pseudo B s invex functions are introduced by using the concept of symmetric gradient. The examples of quasi B s invex and pseudo B s invex functions are given. The sufficient optimality conditions and Mond Weir type duality results are obtained for a nondifferentiable nonlinear semi infinite programming problem involving quasi B s invex and pseudo B s invex functions.
基金Supported by the National Key Basic Research Special Fund(2003CB415200)the National Science Foundation(70371032 and 60274048)the Doctoral Foundation of the Ministry of Education(20020486035)
文摘The aim of this article is to discuss an asymptotic approximation model and its convergence for the minimax semi-infinite programming problem. An asymptotic surrogate constraints method for the minimax semi-infinite programming problem is presented by making use of two general discrete approximation methods. Simultaneously, the consistence and the epi-convergence of the asymptotic approximation problem are discussed.
文摘In this paper, we present several parametric duality results under various generalized （a,v,p）-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
文摘Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized （a,n, p）-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.
文摘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.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 19871049 and 19731001).
文摘The convergence of the maximum entropy method of nonsmooth semi-infinite programmings is proved, and the stability and the strong stability of the method are discussed.
基金The authors thank Prof.J.Y.Han,Dr.Lian Shujun and the referees for their valuable suggestion.This work was parially supported by the National Natural Science Foundation of China(Grants No.10171055 and 10171118)the Excellent Young Teachers Program of M0E,P.R.C.the Research Committee of the Hong Kong Polytechnic University.
文摘In this paper, we study optimal value functions of generalized semi-infinite min-max programming problems on a noncompact set. Directional derivatives and subdifferential characterizations of optimal value functions are given. Using these properties,we establish first order optimality conditions for unconstrained generalized semi-infinite programming problems.
文摘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.
文摘This paper presents a new method, called the maximum entropy method,for solving semi-infinite programming problems, in which the semi-infinite programmingproblem is approximated by one with a single constraint. The convergence properties forthis method are discussed. Numerical examples are given to show the high effciency of thealgorithm.
