摘要
LINGO主要用来求解大型数学规划问题,而利用它求解约束满足问题尚未见到文献报道。本文以著名的“斑马”问题为例,将这类约束满足问题转化为0-1规划求可行解的问题,利用LINGO求解,取得了满意的结果。
LINGO is mainly used for solving large scale linear programming, but to solve a constraint satisafaction problem with LINGO has never been reported before. This paper take a well-known problem- zebra problem as an example, converted the constraint satisafaction problem of this class to a finding feasible solution of binary integer programming, and the result was satisfactory.
出处
《科技广场》
2006年第7期13-14,共2页
Science Mosaic
关键词
约束满足问题
LINGO
斑马问题
0—1规划
可行解
Constraint Satisafaction Problem
LINGO
Zebra Problem
Binary Integer Programming
Eeasible Solution
