Discrete Optimizing Solution Procedures for Linear and Nonlinear Integer Programming Problems
Discrete Optimizing Solution Procedures for Linear and Nonlinear Integer Programming Problems
复制标题
线性和非线性整数规划问题的离散优化求解过程
DOI：
10.1287/mnsc.12.11.829
复制
发表时间：
1966
影响因子：
5.4
通讯作者：
D. Rice
中科院分区：
文献类型：
--
作者：
S. Reiter;D. Rice
我们提出了一种有界变量中混合整数非凹规划问题的近似解的方法。我们给出了 39 个测试问题的计算结果，这表明该过程提供了一种实用的方法来逼近所测试类型的编程问题的解决方案。我们还发现该方法生成的局部最优值的分布存在明显的规律性；该方法似乎可以在所有可获得结果的问题中生成 Beta 分布。这为进一步探索提供了有趣的机会。
We present a method for approximating the solution of mixed integer non-concave programming problems in bounded variables. We present computational results for 39 test problems which suggest that the procedure offers a practical useful way of approximating solutions of programming problems of the type tested. We have also discovered an apparent regularity in the distribution of local optima generated by the method; the method seems to generate Beta distributions in all problems for which results are available. This suggests interesting opportunities for further exploration.