Rearch on Winning Decision’s Optimizing Algorithm for Combinatorial Bidding Purchase of Service in the Supply Chain

For the actual requirements of combinatorial purchase of service in the supply chain, the process of Euclidean distance is presented in this paper to solve the winning decision problem. The method uses mixed set programming to describe all the relations and constraints in the decentralized object programming models which are different in orientation and dimension. The optimizing algorithm is designed and iterated for minimum distance to find the satisfactory solution. A numerical example confirms the validity and practicability of the algorithm