summaryrefslogtreecommitdiff
path: root/tests/general_tests/cbcintlinprog/cbcintlinprog_alternateoptima.sce
diff options
context:
space:
mode:
Diffstat (limited to 'tests/general_tests/cbcintlinprog/cbcintlinprog_alternateoptima.sce')
-rw-r--r--tests/general_tests/cbcintlinprog/cbcintlinprog_alternateoptima.sce42
1 files changed, 42 insertions, 0 deletions
diff --git a/tests/general_tests/cbcintlinprog/cbcintlinprog_alternateoptima.sce b/tests/general_tests/cbcintlinprog/cbcintlinprog_alternateoptima.sce
new file mode 100644
index 0000000..c6b548a
--- /dev/null
+++ b/tests/general_tests/cbcintlinprog/cbcintlinprog_alternateoptima.sce
@@ -0,0 +1,42 @@
+// Degeneracy
+
+// Reference : Example 5-2, The Simplex method and Sensitivity Analysis, Hamdy A. Taha. "Operations Research-An Introduction", 9E(2014))
+
+// Objective function
+c = [-2,-4]';
+
+// Lower Bound of variable
+lb = [0,0]
+// Upper Bound of variables
+ub = [%inf,%inf]
+
+// Constraint Matrix
+A = [1,2;
+1,1]
+
+b=[5,4]
+
+intcon = [1];
+
+// Calling cbcintlinprog
+[x,f,status,output] = cbcintlinprog(c,intcon,A,b,[],[],lb,ub)
+// output =
+//
+// relativegap: 0
+// absolutegap: 0
+// numnodes: 0
+// numfeaspoints: 1
+// numiterations: 0
+// constrviolation: 0
+// message: "Optimal Solution"
+// status =
+//
+// 0.
+// f =
+//
+// - 10.
+// x =
+//
+// 0.
+// 2.5
+//