Application of Bender’s Decomposition Solving a Feed–mix Problem among Supply and Demand Uncertainties

The feed-mix problem is primarily transformed into a mixing situation applying a mathematic formulation with uncertainties. These uncertainties generate the numerous expansions of alternative constraint equations. The given problem has been formulated as mathematic models which correspond to a large-scale Stochastic Programming that cannot be solved by the most popular ordinary calculation method, Simplex Method: LINPROG. This research aims to investigate effective methodology to reveal the optimal solution. The authors have examined the method of Bender’s decomposition: BENDER and developed both methods into MATLAB program and calculated comparatively. The results revealed that the nearest optimal solutions can be determined by means of a Two-stage Stochastic Programing incorporated with Bender’s decomposition at the most intensive number of uncertainties and take less calculation time than by LINPROG.