Abstract
This text explains the methods used in solving linear and integer programming models, using simplified numerical examples. It also describes less common methods such as Farrier's method for linear inequalities, projective transformations and Booleau algebra applied to 0-1 integer models.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
