Abstract
Many decision support systems for feedstock companies include an option for the solution of large linear programming problems. A three-level decomposition algorithm is presented which substantially improves the solution times for such linear programming problems. When decisions must be made on the addition of new raw materials or extra quantities of existing raw materials to feed mixes, the usual approach is to use parametric linear programming. A new approach to this decision problem, based on the results of the three-level decomposition algorithm, is presented in the paper. Finally, implementation issues and the computational performance of the new approaches on real-world problems are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
