Problems that could be made in the linear program method except for the condition that part or all of his variable must take the form of the integer (integer) was acknowledged as the problem of Integer Linier Programming.
Integer Programming was the problem programming where the optimal solution must produce the integer (integer) so not the fragment. In other words from various integers, must choose and look for the values of the flexible variable and made the Objective function of becoming the maximum. Integer Programming was also said as the program of the count sum, where the program of the sum of the variable count was restricted as the count sum was not negative.
1 comment:
yah setidaknya setelah baca ini aku jadi sedikit ngerti. makasi ya.:)
Post a Comment