Abstract
The operation planning process of dining porcelain production is very complicated in respect to computation. It results from differentiated shares of single articles in assumed quality grades and from differing demand structures. The central part of this process, which is described in terms of a linear programming problem with a block structure of restrictions, is discussed in this paper. The solution algorithm based on Bender's decomposition idea is presented. Application of Benders's decomposition enables programming of the problem for microcomputer equipment.
Sign-in/Register to access full text options 
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.
