Oriented to the combinatorial optimization problem with fixed sum of goods and multiple optimal solutions, the problem formulation was given by two examples:the fixed sum real number subset problem and buying wings problem. A integer state and a real number state multi-optimal solution dynamic programming algorithm based on 0-1 decision recursive search was put forward on the foundation of analysis of some classical methods like enumeration. In order to cope with the problem of time complexity tending to the extreme O(mⁿ) when the number of optimal solutions is large for the proposed algorithms, two improved algorithms, the same decision path fusion algorithm and the 0-x decision based algorithm were proposed. The computation time of the improved algorithms is consistent with the proportional relation with O(nb+nm) on the whole in experiments, which indicates that these algorithms have good performance for this type of problem.