Decomposition Principle for Refueling Optimization in Fast Breeder Reactors

摘要

A decompostion principle has been proposed for refueling optimization in fast breeder reactors (FBRs). in refueling optimization a total multistage decision problem with nonlinear programming is decomposed into many partial problems with solvable sie and lienar programming by taking advantage of the FBR physics. First, the problem is decomposed into determinations of the number of refueling subassemblies in concentric annular core zones and the subassembly-by-subassembly refueling patterns.