Article ID: | iaor1996975 |
Country: | Netherlands |
Volume: | 14 |
Issue: | 3 |
Start Page Number: | 269 |
End Page Number: | 281 |
Publication Date: | Jul 1995 |
Journal: | Decision Support Systems |
Authors: | Kunihiko Hiraishi |
Keywords: | constraint handling languages |
The aim of this research is to utilize constraint logic programming (CLP) for solving decision making problems in Operations Research/Management Science. In this research, a new constraint logic programming language Keyed CLP is developed. Keyed CLP has some characteristic features for solving problems in OR/MS. Key arguments can be attached to each predicate, where each key represents the functional dependency in the predicate, and is used for improving computational efficiency and readability of programs. In addition, Keyed CLP has built-in predicates for solving linear optimization problems. To illustrate these features, several examples of decision making problems are solved by Keyed CLP.