In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are establish...In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].展开更多
To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is pro...To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is proposed.Considering the interests of passengers and the airport,the model minimizes the total flight delay,the total passengers′walking distance and the number of flights reassigned to other gates different from the planned ones.According to the characteristics of the gate reassignment,the model is simplified.As the multi-objective programming model is hard to reach the optimal solutions simultaneously,a threshold of satisfactory solutions of the model is set.Then a simulated annealing algorithm is designed for the model.Case studies show that the model decreases the total flight delay to the satisfactory solutions,and minimizes the total passengers′walking distance.The least change of planned assignment is also reached.The results achieve the goals of disruption management.Therefore,the model is verified to be effective.展开更多
In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult...In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.展开更多
In this paper,quadratic 0-1 programming problem (I) is considered, in terms of its features quadratic 0-1 programming problem is solved by linear approxity heurstic algrothm and a developed tabu search ahgrothm .
In presented fuzzy multi-attribute decision-making （FMADM） problems, the information about attribute weights is interval numbers and the decision maker （DM） has fuzzy complementary preference relation on alternati...In presented fuzzy multi-attribute decision-making （FMADM） problems, the information about attribute weights is interval numbers and the decision maker （DM） has fuzzy complementary preference relation on alternatives. Firstly, the decision-making information based on the subjective preference information in the form of the fuzzy complementary judgment matrix is uniform by using a translation function. Then an objective programming model is established. Attribute weights are obtained by solving the model, thus the fuzzy overall values of alternatives are derived by using the additive weighting method. Secondly, the ranking approach of alternatives is proposed based on the degree of similarity between the fuzzy positive ideal solution of alternatives （FPISA） and the fuzzy overall values. The method can sufficiently utilize the objective information of alternatives and meet the subjective requirements of the DM as much as possible. It is easy to be operated and implemented on a computer. Finally, the proposed method is applied to the project evaluation in the venture investment.展开更多
基金Foundation item： Supported by Hunan Provincial Natural Science Foundation of China（05JJ40103） Supported by Soft Science Research Fund of Hunan Province（2006ZK3028） Supported by Scientific Research Fund of Hunan Provincial Education Department（105B0707, 08C470）
文摘In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].
基金Supported by the National Natural Science Foundation of China(71103034)the Natural Science Foundation of Jiangsu Province(bk2011084)
文摘To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is proposed.Considering the interests of passengers and the airport,the model minimizes the total flight delay,the total passengers′walking distance and the number of flights reassigned to other gates different from the planned ones.According to the characteristics of the gate reassignment,the model is simplified.As the multi-objective programming model is hard to reach the optimal solutions simultaneously,a threshold of satisfactory solutions of the model is set.Then a simulated annealing algorithm is designed for the model.Case studies show that the model decreases the total flight delay to the satisfactory solutions,and minimizes the total passengers′walking distance.The least change of planned assignment is also reached.The results achieve the goals of disruption management.Therefore,the model is verified to be effective.
文摘In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.
文摘In this paper,quadratic 0-1 programming problem (I) is considered, in terms of its features quadratic 0-1 programming problem is solved by linear approxity heurstic algrothm and a developed tabu search ahgrothm .
文摘In presented fuzzy multi-attribute decision-making （FMADM） problems, the information about attribute weights is interval numbers and the decision maker （DM） has fuzzy complementary preference relation on alternatives. Firstly, the decision-making information based on the subjective preference information in the form of the fuzzy complementary judgment matrix is uniform by using a translation function. Then an objective programming model is established. Attribute weights are obtained by solving the model, thus the fuzzy overall values of alternatives are derived by using the additive weighting method. Secondly, the ranking approach of alternatives is proposed based on the degree of similarity between the fuzzy positive ideal solution of alternatives （FPISA） and the fuzzy overall values. The method can sufficiently utilize the objective information of alternatives and meet the subjective requirements of the DM as much as possible. It is easy to be operated and implemented on a computer. Finally, the proposed method is applied to the project evaluation in the venture investment.
