Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming

Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming

0.00 Avg rating0 Votes
Article ID: iaor2003382
Country: United Kingdom
Volume: 29
Issue: 10
Start Page Number: 1441
End Page Number: 1446
Publication Date: Sep 2002
Journal: Computers and Operations Research
Authors: ,
Abstract:

An article entitled: ‘A Note on Modeling Multiple Choice Requirements for Simple Mixed Integer Programming Solvers’ was published by Ogryczak. In this article, Ogryczak proposed a reformulation technique called special ordered inequalities (SOI) to model the non-convex programming problems with special ordered sets (SOS) of variables. The SOI technique appears to be analogous to the reformulation technique introduced by Bricker and is related to the reformulation and transformation technique (RTT) developed by Lin and Bricker. Since none of this literature was cited in the references of Ogryczak, we would like to use this note to differentiate SOI and RTT and to elaborate their connection.

Reviews

Required fields are marked *. Your email address will not be published.