Abstract
In order to reduce the number of binary variables in a mixed integer LP model, the principle of binary coding is employed for the formulation of various multiple-choice situations. On the basis of a given coding matrix it is possible to find powerful constraints which define the binary coding procedure within an LP model. This procedure may be employed if the LP code available has not the potential to handle special ordered sets of type 1 algorithmically.
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.
