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.展开更多
Hanson and Mond have grven sets of necessary and sufficient conditions for optimality in constrained optimization by introducing classes of generalized functions, called type Ⅰ functions. Recently, Bector definded un...Hanson and Mond have grven sets of necessary and sufficient conditions for optimality in constrained optimization by introducing classes of generalized functions, called type Ⅰ functions. Recently, Bector definded univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, additional conditions are attached to the Kuhn Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications.展开更多
In this paper,we consider a robust semi-infinite interval-valued optimization problem with inequality constraints having an uncertain parameter.The parametric representation of the aforesaid problem is also considered...In this paper,we consider a robust semi-infinite interval-valued optimization problem with inequality constraints having an uncertain parameter.The parametric representation of the aforesaid problem is also considered in order to derive the necessary and sufficient optimality conditions.Furthermore,we formulate a mixed-type dual problem and derive duality results which associate the robust weak efficient solution of the primal and its dual problems.Several examples are given to illustrate the results in the manuscript.展开更多
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.展开更多
This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators ...This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.展开更多
In this paper,the quadratic program problem and minimum discrimination information (MDI) problem with a set of quadratic inequality constraints and entropy constraints of density are considered.Based on the properties...In this paper,the quadratic program problem and minimum discrimination information (MDI) problem with a set of quadratic inequality constraints and entropy constraints of density are considered.Based on the properties of the generalized geometric programming,the dual programs of these two problems are derived.Furthermore,the duality theorems and related Kuhn-Tucker conditions for two pairs of the prime-dual programs are also established by the duality theory.展开更多
Refrigeration system holds an important role in process industries. The optimal synthesis cannot only reduce the energy consumption, but also save the production costs. In this study, a general methodology is develope...Refrigeration system holds an important role in process industries. The optimal synthesis cannot only reduce the energy consumption, but also save the production costs. In this study, a general methodology is developed for the optimal design of refrigeration cycle and heat exchanger network(HEN) simultaneously. Taking the heat integration between the external heat sources/sinks and the refrigeration cycle into consideration, a superstructure with sub-coolers is developed. Through defining logical variables that indicate the relative temperature positions of refrigerant streams after sub-coolers, the synthesis is formulated as a Generalized Disjunctive Programming(GDP) problem based on LP transshipment model, with the target of minimizing the total compressor shaft work in the refrigeration system. The GDP model is then reformulated as a Mixed Integer Nonlinear Programming(MINLP) problem with the aid of binary variables and Big-M Constraint Method. The efficacy of the process synthesis model is demonstrated by a case study of ethylene refrigeration system. The result shows that the optimization can significantly reduce the exergy loss as well as the total compression shaft work.展开更多
This thesis presents the combination of the stochastic programming and generalized goal programming. We puts forward several generalized goal programming models with stochastic parameter--stochastic generalized goal p...This thesis presents the combination of the stochastic programming and generalized goal programming. We puts forward several generalized goal programming models with stochastic parameter--stochastic generalized goal programming. Furthermore, we probe into the theory. and algorithm of these models. At last, this method was applied to an example of an industrial problem.展开更多
The definitions of generalized pseudoconvex,generalized quasiconvex and its stri ctly generalized convexity were presented for the static programming at locally star -shaped set using the concept of right-upper deriva...The definitions of generalized pseudoconvex,generalized quasiconvex and its stri ctly generalized convexity were presented for the static programming at locally star -shaped set using the concept of right-upper derivative and the concept of sub linear. The sufficient and necessary conditions of the static programming were d erived in terms of a generalized Lemma in this paper. The results obtained are u seful for the further study on the duality of static programming and cover many already known conditions.展开更多
In this paper,on the basis of making full use of the characteristics of unconstrained generalized geometric programming（GGP）,we establish a nonmonotonic trust region algorithm via the conjugate path for solving unco...In this paper,on the basis of making full use of the characteristics of unconstrained generalized geometric programming（GGP）,we establish a nonmonotonic trust region algorithm via the conjugate path for solving unconstrained GGP problem.A new type of condensation problem is presented,then a particular conjugate path is constructed for the problem,along which we get the approximate solution of the problem by nonmonotonic trust region algorithm,and further prove that the algorithm has global convergence and quadratic convergence properties.展开更多
To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programmi...To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John （G-F-J） and G-Karnsh-Kuhn-Tucker （G-K-K-T） types sufficient optimality conditions were established for a feasible solution to be an efficient solution.Moreover,weak and strict duality results were derived for a G-Mond-Weir type dual under various types of generalized dI-G-type Ⅰ invexity assumptions.展开更多
In this article, four new classes of systems of generalized vector quasi-equilibrium problems are introduced and studied in FC-spaces without convexity structure. The notions of Ci（x）-FC-partially diagonally quasico...In this article, four new classes of systems of generalized vector quasi-equilibrium problems are introduced and studied in FC-spaces without convexity structure. The notions of Ci（x）-FC-partially diagonally quasiconvex, Ci（x）-FC-quasiconvex, and Ci（x）-FC- quasiconvex-like for set-valued mappings are also introduced in FC-spaces. By applying these notions and a maximal element theorem, the nonemptyness and compactness of solution sets for four classes of systems of generalized vector quasi-equilibrium problems are proved in noncompact FC-spaces. As applications, some new existence theorems of solutions for mathematical programs with system of generalized vector quasi-equilibrium constraints are obtained in FC-spaces. These results improve and generalize some recent known results in literature.展开更多
Based on former studies on weather simulator modules in IPMist laboratory, study on visual programming of stochastic weather generator(VS-WGEN)was continued. In this study, Markov Chain, Monte Carlo, Fourier Series, a...Based on former studies on weather simulator modules in IPMist laboratory, study on visual programming of stochastic weather generator(VS-WGEN)was continued. In this study, Markov Chain, Monte Carlo, Fourier Series, and weak stationary process were used to generate the daily weather data in software Matlab 6. 0, with the data input from 40 years' weather data recorded by Beijing Weather Station. The generated data includes daily maximum temperature, minimum temperature, precipitation and solar radiation. It has been verified that the weather data generated by the VS-WGEN were more accurate than that by the old WGEN, when twenty new model parameters were included. VS-WGEN has wide software applications, such as pest risk analysis, pest forecast and management. It can be implemented in hardware development as well, such as weather control in weather chamber and greenhouse for researches on ecological adaptation of crop varieties to a given location over time and space. Overall, VS-WGEN is a very useful tool for studies on theoretical and applied ecology.展开更多
This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-...This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semiinfinite programming problem and establish weak,strong and strict converse duality theorems relating the primal and the dual problems.展开更多
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 study some new systems of generalized quasi-variational inclusion problems in FC-spaces without convexity structure.By applying an existence theorem of maximal elements of set-valued mappings due to ...In this paper, we study some new systems of generalized quasi-variational inclusion problems in FC-spaces without convexity structure.By applying an existence theorem of maximal elements of set-valued mappings due to the author, some new existence theorems of solutions for the systems of generalized quasi-variational inclusion problems are proved in noncompact FC-spaces. As applications, some existence results of solutions for the system of quasi-optimization problems and mathematical programs with the systems of generalized quasi-variational inclusion constraints are obtained in FC-spaces.展开更多
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.
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.展开更多
This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fau...This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fault diagnoser in current use, an improved online fault diagnosis algorithm that integrates generalized mutual exclusion constraints (GMECs) and integer linear programming (ILP) is proposed. Assume that the POPN structure and its initial markings are known, and the faults are modeled as unobservable transitions. First, the event sequence is observed and recorded. GMEC is used for elementary diagnosis of the system behavior, then the ILP problem of POPN is solved for further diagnosis. Finally, an example of a real DES to test the new fault diagnoser is analyzed. The proposed algorithm increases the diagnosability of the DES remarkably, and the effectiveness of the new algorithm integrating GMEC and ILP is verified.展开更多
The problem of a semi-infinite medium subjected to thermal shock on its plane boundary is solved in the context of the dual-phase-lag thermoelastic model. The expressions for temperature, displacement and stress are p...The problem of a semi-infinite medium subjected to thermal shock on its plane boundary is solved in the context of the dual-phase-lag thermoelastic model. The expressions for temperature, displacement and stress are presented. The governing equations are expressed in Laplace transform domain and solved in that domain. The solution of the problem in the physical domain is obtained by using a numerical method for the inversion of the Laplace transforms based on Fourier series expansions. The numerical estimates of the displacement, temperature, stress and strain are obtained for a hypothetical material. The results obtained are presented graphically to show the effect phase-lag of the heat flux and a phase-lag of temperature gradient on displacement, temperature, stress.展开更多
基金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.
文摘Hanson and Mond have grven sets of necessary and sufficient conditions for optimality in constrained optimization by introducing classes of generalized functions, called type Ⅰ functions. Recently, Bector definded univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, additional conditions are attached to the Kuhn Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications.
基金supported by the MATRICES,SERB-DST,New Delhi,India(No.MTR/2021/000002).
文摘In this paper,we consider a robust semi-infinite interval-valued optimization problem with inequality constraints having an uncertain parameter.The parametric representation of the aforesaid problem is also considered in order to derive the necessary and sufficient optimality conditions.Furthermore,we formulate a mixed-type dual problem and derive duality results which associate the robust weak efficient solution of the primal and its dual problems.Several examples are given to illustrate the results in the manuscript.
基金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.
基金Supported by Chongqing Key Lab. of Operations Research and System Engineering
文摘This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.
文摘In this paper,the quadratic program problem and minimum discrimination information (MDI) problem with a set of quadratic inequality constraints and entropy constraints of density are considered.Based on the properties of the generalized geometric programming,the dual programs of these two problems are derived.Furthermore,the duality theorems and related Kuhn-Tucker conditions for two pairs of the prime-dual programs are also established by the duality theory.
基金Supported by the National Natural Science Foundation of China(21676183)
文摘Refrigeration system holds an important role in process industries. The optimal synthesis cannot only reduce the energy consumption, but also save the production costs. In this study, a general methodology is developed for the optimal design of refrigeration cycle and heat exchanger network(HEN) simultaneously. Taking the heat integration between the external heat sources/sinks and the refrigeration cycle into consideration, a superstructure with sub-coolers is developed. Through defining logical variables that indicate the relative temperature positions of refrigerant streams after sub-coolers, the synthesis is formulated as a Generalized Disjunctive Programming(GDP) problem based on LP transshipment model, with the target of minimizing the total compressor shaft work in the refrigeration system. The GDP model is then reformulated as a Mixed Integer Nonlinear Programming(MINLP) problem with the aid of binary variables and Big-M Constraint Method. The efficacy of the process synthesis model is demonstrated by a case study of ethylene refrigeration system. The result shows that the optimization can significantly reduce the exergy loss as well as the total compression shaft work.
文摘This thesis presents the combination of the stochastic programming and generalized goal programming. We puts forward several generalized goal programming models with stochastic parameter--stochastic generalized goal programming. Furthermore, we probe into the theory. and algorithm of these models. At last, this method was applied to an example of an industrial problem.
基金National Natural Science Foundation ofChina(No.70273029)
文摘The definitions of generalized pseudoconvex,generalized quasiconvex and its stri ctly generalized convexity were presented for the static programming at locally star -shaped set using the concept of right-upper derivative and the concept of sub linear. The sufficient and necessary conditions of the static programming were d erived in terms of a generalized Lemma in this paper. The results obtained are u seful for the further study on the duality of static programming and cover many already known conditions.
基金Supported by the National Science Foundation of China（10671126） Supported by the Shanghai Municipal Government Project（S30501）+3 种基金 Supported by the Innovation Fund Project for Graduate Student of Shanghai（JWCXSL1001） Supported by the Youth Foundation of Henan Polytechnic University（Q20093） Supported by the Applied Mathematics Provinciallevel Key Discipline of Henan Province Supported by Operational Research and Control Theory Key Discipline of Henan Polytechnic University
文摘In this paper,on the basis of making full use of the characteristics of unconstrained generalized geometric programming（GGP）,we establish a nonmonotonic trust region algorithm via the conjugate path for solving unconstrained GGP problem.A new type of condensation problem is presented,then a particular conjugate path is constructed for the problem,along which we get the approximate solution of the problem by nonmonotonic trust region algorithm,and further prove that the algorithm has global convergence and quadratic convergence properties.
基金National Natural Science Foundation of China(No.11071110)
文摘To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John （G-F-J） and G-Karnsh-Kuhn-Tucker （G-K-K-T） types sufficient optimality conditions were established for a feasible solution to be an efficient solution.Moreover,weak and strict duality results were derived for a G-Mond-Weir type dual under various types of generalized dI-G-type Ⅰ invexity assumptions.
基金supported by the Scientific Research Fun of Sichuan Normal University (09ZDL04)the Sichuan Province Leading Academic Discipline Project (SZD0406)
文摘In this article, four new classes of systems of generalized vector quasi-equilibrium problems are introduced and studied in FC-spaces without convexity structure. The notions of Ci（x）-FC-partially diagonally quasiconvex, Ci（x）-FC-quasiconvex, and Ci（x）-FC- quasiconvex-like for set-valued mappings are also introduced in FC-spaces. By applying these notions and a maximal element theorem, the nonemptyness and compactness of solution sets for four classes of systems of generalized vector quasi-equilibrium problems are proved in noncompact FC-spaces. As applications, some new existence theorems of solutions for mathematical programs with system of generalized vector quasi-equilibrium constraints are obtained in FC-spaces. These results improve and generalize some recent known results in literature.
基金supported jointly by the grant of Project“973”:Fundamental Studies on Invasion and Control of Extra Pest(2002CB111400)the grant of Key Project of Ministry of Science and Technology of China:Development of New Technologies for Pest Forecasting(2001BA50PB01).
文摘Based on former studies on weather simulator modules in IPMist laboratory, study on visual programming of stochastic weather generator(VS-WGEN)was continued. In this study, Markov Chain, Monte Carlo, Fourier Series, and weak stationary process were used to generate the daily weather data in software Matlab 6. 0, with the data input from 40 years' weather data recorded by Beijing Weather Station. The generated data includes daily maximum temperature, minimum temperature, precipitation and solar radiation. It has been verified that the weather data generated by the VS-WGEN were more accurate than that by the old WGEN, when twenty new model parameters were included. VS-WGEN has wide software applications, such as pest risk analysis, pest forecast and management. It can be implemented in hardware development as well, such as weather control in weather chamber and greenhouse for researches on ecological adaptation of crop varieties to a given location over time and space. Overall, VS-WGEN is a very useful tool for studies on theoretical and applied ecology.
文摘This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semiinfinite programming problem and establish weak,strong and strict converse duality theorems relating the primal and the dual problems.
文摘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.
基金supported by the Scientific Research Fun of Sichuan Normal University(09ZDL04)the Sichuan Province Leading Academic Discipline Project(SZD0406)
文摘In this paper, we study some new systems of generalized quasi-variational inclusion problems in FC-spaces without convexity structure.By applying an existence theorem of maximal elements of set-valued mappings due to the author, some new existence theorems of solutions for the systems of generalized quasi-variational inclusion problems are proved in noncompact FC-spaces. As applications, some existence results of solutions for the system of quasi-optimization problems and mathematical programs with the systems of generalized quasi-variational inclusion constraints are obtained in FC-spaces.
文摘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.
基金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.
基金supported by the National Natural Science Foundation of China(61473144)
文摘This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fault diagnoser in current use, an improved online fault diagnosis algorithm that integrates generalized mutual exclusion constraints (GMECs) and integer linear programming (ILP) is proposed. Assume that the POPN structure and its initial markings are known, and the faults are modeled as unobservable transitions. First, the event sequence is observed and recorded. GMEC is used for elementary diagnosis of the system behavior, then the ILP problem of POPN is solved for further diagnosis. Finally, an example of a real DES to test the new fault diagnoser is analyzed. The proposed algorithm increases the diagnosability of the DES remarkably, and the effectiveness of the new algorithm integrating GMEC and ILP is verified.
文摘The problem of a semi-infinite medium subjected to thermal shock on its plane boundary is solved in the context of the dual-phase-lag thermoelastic model. The expressions for temperature, displacement and stress are presented. The governing equations are expressed in Laplace transform domain and solved in that domain. The solution of the problem in the physical domain is obtained by using a numerical method for the inversion of the Laplace transforms based on Fourier series expansions. The numerical estimates of the displacement, temperature, stress and strain are obtained for a hypothetical material. The results obtained are presented graphically to show the effect phase-lag of the heat flux and a phase-lag of temperature gradient on displacement, temperature, stress.
