summaryrefslogtreecommitdiff
path: root/tests/general_tests/cbcintlinprog/cbcintlinprog_intcon2.sce
diff options
context:
space:
mode:
Diffstat (limited to 'tests/general_tests/cbcintlinprog/cbcintlinprog_intcon2.sce')
-rw-r--r--tests/general_tests/cbcintlinprog/cbcintlinprog_intcon2.sce34
1 files changed, 34 insertions, 0 deletions
diff --git a/tests/general_tests/cbcintlinprog/cbcintlinprog_intcon2.sce b/tests/general_tests/cbcintlinprog/cbcintlinprog_intcon2.sce
new file mode 100644
index 0000000..bfdff9a
--- /dev/null
+++ b/tests/general_tests/cbcintlinprog/cbcintlinprog_intcon2.sce
@@ -0,0 +1,34 @@
+// Check if a user specifies coefficients of linear inequality contraints of the correct dimensions
+
+// Reference : Example 1-3, Integer Linear Programming, Hamdy A. Taha. "Operations Research-An Introduction", 9E(2014))
+
+// Objective function
+c = [0.25,0.21,0.22,16,25,18]';
+
+// Lower Bound of variable
+lb = repmat(0,1,6);
+// Upper Bound of variables
+ub = [repmat(%inf,1,3) repmat(1,1,3)];
+
+// Constraint Matrix
+A = [1, 0, 0, -200, 0, 0;
+0, 1, 0, 0, -200, 0;
+0, 0, 1, 0, 0, -200]
+
+b=[0, 0, 0]
+
+Aeq = [1, 1, 1, 0, 0, 0]
+
+beq = [ 200]
+
+intcon = [4 5 6 10];
+
+// Calling cbcintlinprog
+[x,f,status,output] = cbcintlinprog(c,intcon,A,b,Aeq,beq,lb,ub)
+// !--error 10000
+//cbcintlinprog: The values inside intcon should be less than the number of variables
+//at line 111 of function cbcmatrixintlinprog called by :
+//at line 203 of function cbcintlinprog called by :
+//[x,f,status,output] = cbcintlinprog(c,intcon,A,b,Aeq,beq,lb,ub)
+//at line 27 of exec file called by :
+//exec cbcintlinprog_intcon2.sce