An uncertain multi-objective programming problem is a special type of mathematical multi-objective programming involving uncertain variables. This type of problem is important because there are several uncertain varia...An uncertain multi-objective programming problem is a special type of mathematical multi-objective programming involving uncertain variables. This type of problem is important because there are several uncertain variables in real-world problems.Therefore, research on the uncertain multi-objective programming problem is highly relevant, particularly those problems whose objective functions are correlated. In this paper, an approach that solves an uncertain multi-objective programming problem under the expected-variance value criterion is proposed. First, we define the basic framework of the approach and review concepts such as a Pareto efficient solution and expected-variance value criterion using an order relation between various uncertain variables.Second, the uncertain multi-objective problem is converted into an uncertain single-objective programming problem via a linear weighted method or ideal point method. Then the problem is transformed into a deterministic single objective programming problem under the expected-variance value criterion. Third, four lemmas and two theorems are proved to illustrate that the optimal solution of the deterministic single-objective programming problem is an efficient solution to the original uncertainty problem. Finally, two numerical examples are presented to validate the effectiveness of the proposed approach.展开更多
To overcome the defects that the traditional ap-proach for multi-objective programming under uncertain ran-dom environment(URMOP)neglects the randomness and uncer-tainty of the problem and the volatility of the result...To overcome the defects that the traditional ap-proach for multi-objective programming under uncertain ran-dom environment(URMOP)neglects the randomness and uncer-tainty of the problem and the volatility of the results,a new ap-proach is proposed based on expected value-standard devi-ation value criterion(C_(ESD) criterion).Firstly,the effective solution to the URMOP problem is defined;then,by applying sequence relationship between the uncertain random variables,the UR-MOP problem is transformed into a single-objective program-ming(SOP)under uncertain random environment(URSOP),which are transformed into a deterministic counterpart based on the C_(ESD) criterion.Then the validity of the new approach is proved that the optimal solution to the SOP problem is also effi-cient for the URMOP problem;finally,a numerical example and a case application are presented to show the effectiveness of the new approach.展开更多
Based on the slip-line field theory, a two-dimensional slip failure mechanism with mesh-like rigid block system was constructed to analyze the ultimate bearing capacity problems of rough foundation within the framewor...Based on the slip-line field theory, a two-dimensional slip failure mechanism with mesh-like rigid block system was constructed to analyze the ultimate bearing capacity problems of rough foundation within the framework of the upper bound limit analysis theorem. In the velocity discontinuities in transition area, the velocity changes in radial and tangent directions are allowed. The objective functions of the stability problems of geotechnical structures are obtained by equating the work rate of external force to internal dissipation along the velocity discontinuities, and then the objective functions are transformed as an upper-bound mathematic optimization model. The upper bound solutions for the objective functions are obtained by use of the nonlinear sequential quadratic programming and interior point method. From the numerical results and comparative analysis, it can be seen that the method presented in this work gives better calculation results than existing upper bound methods and can be used to establish the more accurate plastic collapse load for the ultimate bearing capacity of rough foundation.展开更多
This paper deals with multiobjective programming problems with support functions under （G, C, ρ）-convexity assumptions. Not only sufficient but also necessary optimality conditions for this kind of multiobjective p...This paper deals with multiobjective programming problems with support functions under （G, C, ρ）-convexity assumptions. Not only sufficient but also necessary optimality conditions for this kind of multiobjective programming problems are established from a viewpoint of （G, C, ρ）-convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for general Mond-Weir type dual program.展开更多
基金supported by the National Natural Science Foundation of China(71601183 71571190)
文摘An uncertain multi-objective programming problem is a special type of mathematical multi-objective programming involving uncertain variables. This type of problem is important because there are several uncertain variables in real-world problems.Therefore, research on the uncertain multi-objective programming problem is highly relevant, particularly those problems whose objective functions are correlated. In this paper, an approach that solves an uncertain multi-objective programming problem under the expected-variance value criterion is proposed. First, we define the basic framework of the approach and review concepts such as a Pareto efficient solution and expected-variance value criterion using an order relation between various uncertain variables.Second, the uncertain multi-objective problem is converted into an uncertain single-objective programming problem via a linear weighted method or ideal point method. Then the problem is transformed into a deterministic single objective programming problem under the expected-variance value criterion. Third, four lemmas and two theorems are proved to illustrate that the optimal solution of the deterministic single-objective programming problem is an efficient solution to the original uncertainty problem. Finally, two numerical examples are presented to validate the effectiveness of the proposed approach.
基金supported by the National Natural Science Foundation of China(72001213)the basic research program of Natural Science of Shaanxi Province,China(2021JQ-369).
文摘To overcome the defects that the traditional ap-proach for multi-objective programming under uncertain ran-dom environment(URMOP)neglects the randomness and uncer-tainty of the problem and the volatility of the results,a new ap-proach is proposed based on expected value-standard devi-ation value criterion(C_(ESD) criterion).Firstly,the effective solution to the URMOP problem is defined;then,by applying sequence relationship between the uncertain random variables,the UR-MOP problem is transformed into a single-objective program-ming(SOP)under uncertain random environment(URSOP),which are transformed into a deterministic counterpart based on the C_(ESD) criterion.Then the validity of the new approach is proved that the optimal solution to the SOP problem is also effi-cient for the URMOP problem;finally,a numerical example and a case application are presented to show the effectiveness of the new approach.
基金Projects(51078359, 51208522) supported by the National Natural Science Foundation of ChinaProjects(20110491269, 2012T50708) supported by China Postdoctoral Science FoundationProject supported by Postdoctoral Science Foundation of Central South University, China
文摘Based on the slip-line field theory, a two-dimensional slip failure mechanism with mesh-like rigid block system was constructed to analyze the ultimate bearing capacity problems of rough foundation within the framework of the upper bound limit analysis theorem. In the velocity discontinuities in transition area, the velocity changes in radial and tangent directions are allowed. The objective functions of the stability problems of geotechnical structures are obtained by equating the work rate of external force to internal dissipation along the velocity discontinuities, and then the objective functions are transformed as an upper-bound mathematic optimization model. The upper bound solutions for the objective functions are obtained by use of the nonlinear sequential quadratic programming and interior point method. From the numerical results and comparative analysis, it can be seen that the method presented in this work gives better calculation results than existing upper bound methods and can be used to establish the more accurate plastic collapse load for the ultimate bearing capacity of rough foundation.
基金supported by the Natural Science Foundation of Guangdong Province under Grant No.S2013010013101the Science Foundations of Hanshan Normal University under Grant Nos.QD20131101and LZ201403
文摘This paper deals with multiobjective programming problems with support functions under （G, C, ρ）-convexity assumptions. Not only sufficient but also necessary optimality conditions for this kind of multiobjective programming problems are established from a viewpoint of （G, C, ρ）-convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for general Mond-Weir type dual program.
