Year-end Sale % OFF 
Abstract
Special ordered sets (SOS) have been introduced as a practical device for efficiently handling special classes of nonconvex optimization problems. They are now implemented in most commercial codes for mathematical programming (MP software). The paper gives a survey of possible applications as multiple choice restrictions, conditional multiple choice restrictions, discrete variables, discontinuous variables and piecewise linear functions, global optimization of separable programming problems, alternative right-hand sides, overlapping special ordered sets and the solution of quadratic programming problems. Alternative problem formulations are discussed. Since special ordered sets are not defined uniquely modelling facilities depend on the definition of a special orderedset in a code. The paper demonstrates the superiority of SOS to the application of binary variables if they are treated judiciously.
Published Version
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.
