
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
The feedmix 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 largescale 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 Twostage Stochastic Programing incorporated with Bender’s decomposition at the most intensive number of uncertainties and take less calculation time than by LINPROG.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment