|
Description
|
There are two sets of instances: 1) general quadratic integer programming problem with linear (resource) constraints; 2) general quadratic integer programming problem without linear constraints;
For general quadratic integer programming problem with linear resource constraints,
Max f(x) =dx + xqx
s.t. ax <= b; (resource constraints: such as people, equipment, material, and budget)
0<=x <=u; (lower and upper bounds of decision variables)
the name of instance is nxxxmyyytt-zzz-in.txt:
xxx is the size of decision variables;
yyy is the number of linear resource constraints where yyy=0.2*xxx or 0.5*xxx;
tt='e' is the type of instance with large slack value of 'b'
tt='d' is the type of instance with medium slack value of 'b'
tt='h' is the type of instance with small slack value of 'b'
zzz is the type of instances, zzz =1, 2, 3, 4, and 5
For zzz=1, the range of value for d and q elements is -20 to 20, the upper bound of decision variable is 10, the range of value for a is 0 to 9
For zzz=2, the range of value for d and q elements is -40 to 40, the upper bound of decision variable is 20, the range of value for a is 0 to 19
For zzz=3, the range of value for d and q elements is -80 to 80, the upper bound of decision variable is 40, the range of value for a is 0 to 39
For zzz=4, the range of value for d and q elements is -160 to 160, the upper bound of decision variable is 80, the range of value for a is 0 to 79
For zzz=5, the range of value for d and q elements is -200 to 200, the upper bound of decision variable is 100, the range of value for a is 0 to 99
for each instance, the input file format is:
name of instance
number of variables n, number of knapsack constraints m
the linear coefficients of the objective function, d
blank line
the quadratic coefficients of the objective function, q,
blank line
the right hand size of source constraints, b
the coefficients of source constraints, a
blank line
the upper bound of decision variable, u
For general quadratic integer programming problem without linear resource constraints:
Max f(x) =dx + xqx
s.t. 0<=x <=u;
the name of instance is nxxx-zzz-in.txt:
xxx is the size of decision variables;
zzz is the type of instances, zzz =1, 2, 3, 4, and 5
For zzz=1, the range of value for d and q elements is -20 to 20, the upper bound of decision variable is 10;
For zzz=2, the range of value for d and q elements is -40 to 40, the upper bound of decision variable is 20;
For zzz=3, the range of value for d and q elements is -80 to 80, the upper bound of decision variable is 40;
For zzz=4, the range of value for d and q elements is -160 to 160, the upper bound of decision variable is 80;
For zzz=5, the range of value for d and q elements is -200 to 200, the upper bound of decision variable is 100;
for each instance, the input file format using is:
name of instance
number of variables n
the linear coefficients of the objective function, d
blank line
the quadratic coefficients of the objective function, q
blank line
the upper bound of decision variable, u
|
