確立のある組合せ分割問題(数学モデルとその解法)

概要

論文の詳細を見る
To ask many optimization problems,we need to caluculate the optimaization value in the combinations.We have asked the optimized parts kind number in the combinations conducted by an integer linear programming.In this report correlating such the optimization problem,we explain an optimization problem to divide the combinations into the several groups.the combinations are resembled to the objects of a class with several attributes which kinds have the occuring probabilities and when the number of objects with same attribute kind is divided by the total objects number,the quotient is equal to the occuring probability of the attribute kind.Satifying such conditions,we aim to ask the optimized combinations division groups evaluated by a function.In the ideal explained problems,it happens hardly to divide into the combinations groups whitch combinations numbers are integers.So it's necessary to ask the combinations groups which combinations numbers are reals and we approximate the real numbers into the integer numbers.As samples of the functions,we state the function averaging the combinations number belonging to the each divided group and the general function.We present a simple example where the number of the each devided combinations group is approached to the mean calculated by the combinations number and the groups number.
九州情報大学の論文