Abstract
This paper extends product mix/linear programming based problem with an infinite number of product types for decisions. The corresponding model becomes a class of semi-infinite linear programming model. With the problem assumptions, the optimal solution can still be theoretically solved using the Simplex based method. To handle the infinite number of decision variables, a set of finite number of variables can be initially generated and then solved and improve sequentially using the classical column generation approach. The proposed procedure was programmed as a MATLAB code and was tested. The computational results are reported.
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: International Journal of Management Science and Engineering Management
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.
