2 files changed, 49 insertions, 3 deletions
diff --git a/tests/general_tests/symphony/symphony_logical2.sce b/tests/general_tests/symphony/symphony_logical2.sce
index 5d0989f..9f34cc0 100644
--- a/tests/general_tests/symphony/symphony_logical2.sce
+++ b/tests/general_tests/symphony/symphony_logical2.sce
@@ -12,9 +12,9 @@ ub = repmat(%inf,3,1);
 
 // Constraint Matrix
 A = [3,2,5;
-             2,1,1;
-             1,1,3;
-             5,2,4]
+     2,1,1;
+     1,1,3;
+     5,2,4]
 
 // Lower Bound of constrains
 conlb = repmat(-%inf,4,1)
diff --git a/tests/general_tests/symphony/symphony_zeros.sce b/tests/general_tests/symphony/symphony_zeros.sce
new file mode 100644
index 0000000..a6615f6
--- /dev/null
+++ b/tests/general_tests/symphony/symphony_zeros.sce
@@ -0,0 +1,46 @@
+// Check for size of Objective Coefficient
+// A basic case :
+
+// Objective function
+c = [0 0 0]';
+
+// Lower Bound of variable
+lb = [];
+
+// Upper Bound of variables
+ub = [];
+
+// Constraint Matrix
+A = []
+
+// Lower Bound of constrains
+conlb = []
+
+// Upper Bound of constrains
+conub = []
+
+// Row Matrix for telling symphony that the is integer or not
+isInt = [repmat(%f,1,3)];
+
+// Output
+//Problem loaded into environment.
+//Note: There is no limit on time.
+//An optimal solution has been found.
+// output  =
+// 
+//   Iterations: 1
+// status  =
+// 
+//    227.  
+// f  =
+// 
+//    0.  
+// x  =
+// 
+//    0.  
+//    0.  
+//    0.
+
+// Calling Symphony
+[x,f,status,output] = symphony(3,0,c,isInt,lb,ub,A,conlb,conub,-1)
+