As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packa...As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packages such as LINDO, and furthermore this model is extendedinto the stochastic version, that is, the minimal spanning tree problem for the digraph with theweights is not constant but random variables. Several algorithms are also developed to solve themodels. Finally, a numerical demonstration is given.展开更多
A novel approach was proposed to allocate spinning reserve for dynamic economic dispatch.The proposed approach set up a two-stage stochastic programming model to allocate reserve.The model was solved using a decompose...A novel approach was proposed to allocate spinning reserve for dynamic economic dispatch.The proposed approach set up a two-stage stochastic programming model to allocate reserve.The model was solved using a decomposed algorithm based on Benders' decomposition.The model and the algorithm were applied to a simple 3-node system and an actual 445-node system for verification,respectively.Test results show that the model can save 84.5 US $ cost for the testing three-node system,and the algorithm can solve the model for 445-node system within 5 min.The test results also illustrate that the proposed approach is efficient and suitable for large system calculation.展开更多
Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new ...Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new century. In order to get a deep insight into this field, some notes on the direct searches for non-smooth optimization problems are made. The global convergence vs. local convergence and their influences on expected solutions for simulation-based stochastic optimization are pointed out. The sufficient and simple decrease criteria for step acceptance are analyzed, and why simple decrease is enough for globalization in direct searches is identified. The reason to introduce the positive spanning set and its usage in direct searches is explained. Other topics such as the generalization of direct searches to bound, linear and non-linear constraints are also briefly discussed.展开更多
文摘As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packages such as LINDO, and furthermore this model is extendedinto the stochastic version, that is, the minimal spanning tree problem for the digraph with theweights is not constant but random variables. Several algorithms are also developed to solve themodels. Finally, a numerical demonstration is given.
基金Projects(51007047,51077087)supported by the National Natural Science Foundation of ChinaProject(2013CB228205)supported by the National Key Basic Research Program of China+1 种基金Project(20100131120039)supported by Higher Learning Doctor Discipline End Scientific Research Fund of the Ministry of Education Institution,ChinaProject(ZR2010EQ035)supported by the Natural Science Foundation of Shandong Province,China
文摘A novel approach was proposed to allocate spinning reserve for dynamic economic dispatch.The proposed approach set up a two-stage stochastic programming model to allocate reserve.The model was solved using a decomposed algorithm based on Benders' decomposition.The model and the algorithm were applied to a simple 3-node system and an actual 445-node system for verification,respectively.Test results show that the model can save 84.5 US $ cost for the testing three-node system,and the algorithm can solve the model for 445-node system within 5 min.The test results also illustrate that the proposed approach is efficient and suitable for large system calculation.
基金supported by the Key Foundation of Southwest University for Nationalities(09NZD001).
文摘Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new century. In order to get a deep insight into this field, some notes on the direct searches for non-smooth optimization problems are made. The global convergence vs. local convergence and their influences on expected solutions for simulation-based stochastic optimization are pointed out. The sufficient and simple decrease criteria for step acceptance are analyzed, and why simple decrease is enough for globalization in direct searches is identified. The reason to introduce the positive spanning set and its usage in direct searches is explained. Other topics such as the generalization of direct searches to bound, linear and non-linear constraints are also briefly discussed.
