分解
分解法(排队论)
本德分解
数学优化
最优化问题
计算机科学
整数(计算机科学)
对偶(语法数字)
数学
离散数学
程序设计语言
生态学
生物
文学类
艺术
作者
Mehrdad Beykverdi,Azar Fakharian,Mostafa Jazaeri
摘要
Article history: Received 16 November 2013 Received in revised form 18 Decomposition refers to the strategy of breaking up a large, difficult-to-solve problem into two or more smaller, easier-to-solve problems, such that the solution to the decomposed problems can be used to obtain the solution to the original problem. In the last years, decomposition techniques such as Benders decomposition are used efficiently and extensively to solve large scale optimization problems (particularly, in mixed integer variable optimization problems such as unit commitment and short term hydrothermal coordination). This paper reviews two basic decomposition methods (primal and dual decomposition) and used them to construct Dantzing-wolfe and Benders decomposition techniques.
科研通智能强力驱动
Strongly Powered by AbleSci AI