Abstract
A cutting plane algorithm is presented in order to solve linear integer programs in a finite number of iterations, under the assumption that the feasible region is bounded. The procedure also applies to the resolution of mixed integer programs in a finite number of iterations under the additional assumption that the optimal objective value is integral.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
