Abstract
This paper presents a new procedure for solving the integer linear programming problem when the objective function is a linear function and the set of constraints is in the form of linear inequality constraints. The proposed procedure is based on the conjugate gradient projection method together with the use of the spirit of Gomory cut. The main idea behind our method is to move through the feasible region through a sequence of points in the direction that improves the objective function. Since methods based on vertex information may have difficulties as the problem size increases, therefore, the present method can be considered as an interior point method, which had been proved to be less sensitive to problem size. A simple production example is given to clarify the theory of this new procedure.
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.
