یک روش تجزیه کروی جدید برای برنامه ریزی خطی تلفیقی عددی تصادفی

Two-stage stochastic mixed-integer linear programming (MILP) problems can arise naturally from a variety of process design and operation problems. These problems, with a scenario based formulation, lead to large-scale MILPs that are well structured. When first-stage variables are mixed-integer and second-stage variables are continuous, these MILPs can be solved efficiently by classical decomposition methods, such as Dantzig/Wolfe decomposition (DWD), Lagrangian decomposition, and Benders decomposition (BD), or a cross decomposition strategy that combines some of the classical decomposition methods. This paper proposes a new cross decomposition method, where BD and DWD are combined in a unified framework to improve the solution of scenario based two-stage stochastic MILPs. This method alternates between DWD iterations and BD iterations, where DWD restricted master problems and BD primal problems yield a sequence of upper bounds, and BD relaxed master problems yield a sequence of lower bounds. The method terminates finitely to an optimal solution or an indication of the infeasibility of the original problem. Case study of two different supply chain systems, a bioproduct supply chain and an industrial chemical supply chain, show that the proposed cross decomposition method has significant computational advantage over BD and the monolith approach, when the number of scenarios is large.