Abstract
Abstract Special Ordered Sets (SOSs) of variables of types 1 and 2 are used in mathematical programming for formulating both multiple choice problems and nonconvex separable programming problems, respectively. This paper suggests problem formulations which may be more efficiently solved by mixed-integer programming codes when special codes for handling SOSs are unavailable. A shipment planning problem is used to illustrate some of these formulations.
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
