{"title":"对偶动态规划算法在水电厂调度中阶梯线性规划中的应用","authors":"T. A. Rotting, A. Gjelsvik","doi":"10.1109/CMPEUR.1992.218487","DOIUrl":null,"url":null,"abstract":"A dual dynamic programming (DDP) technique for staircase linear programs was applied to problems arising in multistage scheduling of hydroelectric power systems. The approach has some similarity to nested Benders' decompositions (J.F. Benders, 1962). The contribution is a computational strategy to arrange the iterations so as to improve convergence over the standard DDP approach. The application also favors use of relaxation in the subproblem, and this is discussed.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Application of a dual dynamic programming algorithm to staircase linear programs arising in scheduling of hydro power plants\",\"authors\":\"T. A. Rotting, A. Gjelsvik\",\"doi\":\"10.1109/CMPEUR.1992.218487\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A dual dynamic programming (DDP) technique for staircase linear programs was applied to problems arising in multistage scheduling of hydroelectric power systems. The approach has some similarity to nested Benders' decompositions (J.F. Benders, 1962). The contribution is a computational strategy to arrange the iterations so as to improve convergence over the standard DDP approach. The application also favors use of relaxation in the subproblem, and this is discussed.<<ETX>>\",\"PeriodicalId\":390273,\"journal\":{\"name\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPEUR.1992.218487\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1992.218487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Application of a dual dynamic programming algorithm to staircase linear programs arising in scheduling of hydro power plants
A dual dynamic programming (DDP) technique for staircase linear programs was applied to problems arising in multistage scheduling of hydroelectric power systems. The approach has some similarity to nested Benders' decompositions (J.F. Benders, 1962). The contribution is a computational strategy to arrange the iterations so as to improve convergence over the standard DDP approach. The application also favors use of relaxation in the subproblem, and this is discussed.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
