| Article ID: | iaor19951491 |
| Country: | United Kingdom |
| Volume: | 1 |
| Issue: | 4 |
| Start Page Number: | 409 |
| End Page Number: | 421 |
| Publication Date: | Oct 1994 |
| Journal: | International Transactions in Operational Research |
| Authors: | Lin E.Y.-H. |
| Keywords: | combinatorial analysis |
Multiple choice programming, originated from Healy Jr, belongs to the non-convex mathematical programming with special ordered sets of variables type 1 as identified by Beale and Tomlin. The high applicability of multiple choice programming in many decision-making problems has made it a focus of many Operational Research OR researchers and practitioners in the fields of integer programming and combinatorics. This paper reports a survey on the structures of multiple choice programming problems and their solution approaches. Applications of multiple choice programming and some prospective future researches are also discussed.