用群论方法求解整数规划问题的初步探讨
A Method for Integer Programming Problem by Theory of Groups
-
摘要: 用有限群的分解理论,将整数规划问题分解为一系列简单的群论规划模型求解,这不论是在理论上还 是实际运用中都将具有一定的意义。在对整数规划问题作变换和松弛处理的基础上详细讨论了向群论规划模 型转换和分解的步骤,并讨论了两种分解结果的求解方法。Abstract: There are so many methods for the problem of integer programming (IP); however, available methods connected with theoryofgroups are still given little consideration. This paper, in orderto predigest the process of solving the IP problem, attempts to divide the IP problem into a series of simple models by using the decomposing theoremof limited groups—significant both in theory and in practice. Based on the translation and loosing operation of IP problem, the steps of transformation and decomposition to the group programming model are discussed in detail, and solutions to two decomposition results are also discussed.
-
Key words:
- integer programming /
- groups /
- limited groups /
- decomposition theory /
- loosing operation
点击查看大图
计量
- 文章访问数: 1257
- HTML全文浏览量: 58
- PDF下载量: 215
- 被引次数: 0