Abstract
This paper addresses itself to the maximization of the yield of some chemical process subject to various operational as well as physical constraints. Some of the operational constraints on such factors as the level of flows and the number of flow change are discrete in nature and standard mathematical formulation leads to a medium scale mixed integer programming problem. A typical problem contains 150 integer variables in addition to 150 continuous variables and 200 constraints. A problem of this size may not possibly be solved by the general purpose mixed integer programming code in accordance with our basic requirement, i.e., in less than one minute on 1 MIPS computer. Thus we introduce a series of relaxation schemes by elaborating the special structure of the problem and reduce the original problem into a set of subproblems, all of which can be solved by standard methods. We tested this algorithm on a number of real scale problems and always obtained almost optimal solution within I minute, whose discrepancy from the true optimum was less than 1% relative to the value of the objective function.
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 callMore From: Journal of the Operations Research Society of Japan
Disclaimer: 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.
