| 一类约束满足问题的LINGO算法 |
| |
| 引用本文： | 李朝阳.一类约束满足问题的LINGO算法[J].科技广场,2006(7):13-14. |
| |
| 作者姓名： | 李朝阳 |
| |
| 作者单位： | 北京工商大学数理系,北京,100037 |
| |
| 摘 要： | LINGO主要用来求解大型数学规划问题,而利用它求解约束满足问题尚未见到文献报道。本文以著名的“斑马”问题为例,将这类约束满足问题转化为0-1规划求可行解的问题,利用LINGO求解,取得了满意的结果。
|
| 关 键 词： | 约束满足问题 LINGO 斑马问题 0-1规划 可行解 |
| 文章编号： | 1670-4792-（2006）7-0047-02 |
a Class of Constraint Satisafaction Problems and LINGO Algorithms |
| |
| Li Zhaoyang.a Class of Constraint Satisafaction Problems and LINGO Algorithms[J].Science Mosaic,2006(7):13-14. |
| |
| Authors: | Li Zhaoyang |
| |
| Institution: | Department of Mathematics and Physics,Beijing Technology and Business University, Beijing 100037 |
| |
| Abstract: | 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. |
| |
| Keywords: | Constraint Satisafaction Problem LINGO Zebra Problem Binary Integer Programming Feasible Solution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
