summaryrefslogtreecommitdiff
path: root/tests/unit_tests/symphony_base.dia.ref
diff options
context:
space:
mode:
authorHarpreet2015-08-27 12:21:29 +0530
committerHarpreet2015-08-27 12:21:29 +0530
commit1019e3a021f5a51a8f7f052ffe499c3ef8aa5136 (patch)
treeb7b2d4bf4119de6b08dee0a4b4b19aa4a597f72f /tests/unit_tests/symphony_base.dia.ref
parent5f6cc4e3a2437a3952761991bcdf67f5c0212cd5 (diff)
downloadFOSSEE-Optimization-toolbox-1019e3a021f5a51a8f7f052ffe499c3ef8aa5136.tar.gz
FOSSEE-Optimization-toolbox-1019e3a021f5a51a8f7f052ffe499c3ef8aa5136.tar.bz2
FOSSEE-Optimization-toolbox-1019e3a021f5a51a8f7f052ffe499c3ef8aa5136.zip
unit_tests complete
Diffstat (limited to 'tests/unit_tests/symphony_base.dia.ref')
-rw-r--r--tests/unit_tests/symphony_base.dia.ref41
1 files changed, 38 insertions, 3 deletions
diff --git a/tests/unit_tests/symphony_base.dia.ref b/tests/unit_tests/symphony_base.dia.ref
index 95339e2..fd11db0 100644
--- a/tests/unit_tests/symphony_base.dia.ref
+++ b/tests/unit_tests/symphony_base.dia.ref
@@ -1,6 +1,6 @@
// Copyright (C) 2015 - IIT Bombay - FOSSEE
//
-// Author: Harpreet Singh
+// Author: Keyur Joshi and Harpreet Singh
// Organization: FOSSEE, IIT Bombay
// Email: harpreet.mertia@gmail.com
//
@@ -9,8 +9,11 @@
// you should have received as part of this distribution. The terms
// are also available at
// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+
// <-- JVM NOT MANDATORY -->
// <-- ENGLISH IMPOSED -->
+
+
//
// assert_close --
// Returns 1 if the two real matrices computed and expected are close,
@@ -30,7 +33,7 @@ function flag = assert_close ( computed, expected, epsilon )
// else
// flag = 0;
// end
-// if flag <> 1 then bugmes();quit;end
+// if flag <> 1 then pause,end
flag = assert_checktrue ( shift < epsilon );
endfunction
//
@@ -46,7 +49,39 @@ endfunction
// else
// flag = 0;
// end
-// if flag <> 1 then bugmes();quit;end
+// if flag <> 1 then pause,end
//endfunction
+// Objective function
+c = [350*5,330*3,310*4,280*6,500,450,400,100]
+
+// Lower Bound of variable
+lb = repmat(0,1,8);
+
+// Upper Bound of variables
+ub = [repmat(1,1,4) repmat(%inf,1,4)];
+
+// Constraint Matrix
+conMatrix = [5,3,4,6,1,1,1,1;
+ 5*0.05,3*0.04,4*0.05,6*0.03,0.08,0.07,0.06,0.03;
+ 5*0.03,3*0.03,4*0.04,6*0.04,0.06,0.07,0.08,0.09;]
+
+// Lower Bound of constrains
+conlb = [ 25; 1.25; 1.25]
+
+// Upper Bound of constrains
+conub = [ 25; 1.25; 1.25]
+
+// Row Matrix for telling symphony that the is integer or not
+isInt = [repmat(%t,1,4) repmat(%f,1,4)];
+
+// Calling Symphony
+[x,f,iter] = symphony(8,3,c,isInt,lb,ub,conMatrix,conlb,conub,1);
+
+//In Symphony Library for optimal solution status = 227
+status = sym_getStatus();
+
+assert_close ( x , [1 1 0 1 7.25 0 0.25 3.5] , 1.e-7 );
+assert_close ( f , [ 8495] , 1.e-7 );
+assert_checkequal( status , 227 );