Comments added

21 files changed, 26 insertions, 4 deletions

diff --git a/qpipopt/qpipopt_LB1.sce b/qpipopt/qpipopt_LB1.sce
index 3492b14..b2b92ce 100644
--- a/qpipopt/qpipopt_LB1.sce
+++ b/qpipopt/qpipopt_LB1.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the user gives lower bound unequal to the number of variables
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_LB2.sce b/qpipopt/qpipopt_LB2.sce
index 9618470..e6df705 100644
--- a/qpipopt/qpipopt_LB2.sce
+++ b/qpipopt/qpipopt_LB2.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the user gives lower bound as a row vector
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_Q1.sce b/qpipopt/qpipopt_Q1.sce
index 37c5d01..06cceea 100644
--- a/qpipopt/qpipopt_Q1.sce
+++ b/qpipopt/qpipopt_Q1.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check for the size of Q matrix
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_Q2.sce b/qpipopt/qpipopt_Q2.sce
index e3088ef..ea23ee4 100644
--- a/qpipopt/qpipopt_Q2.sce
+++ b/qpipopt/qpipopt_Q2.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check for the Q to be a symmetric matrix
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_UB1.sce b/qpipopt/qpipopt_UB1.sce
index e322809..155c695 100644
--- a/qpipopt/qpipopt_UB1.sce
+++ b/qpipopt/qpipopt_UB1.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+	// Check if the user gives unequal size of Upper Bound as of the number of variables
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_UB2.sce b/qpipopt/qpipopt_UB2.sce
index 9fb9112..a4f5270 100644
--- a/qpipopt/qpipopt_UB2.sce
+++ b/qpipopt/qpipopt_UB2.sce
@@ -1,15 +1,16 @@
 //Find x in R^6 such that:
+// Check if the user gives Upper Bound matrix as a row vector 
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
 0,1,0,1,2,-1;
 -1,0,2,1,1,0];
 conLB=[1;2;3;-%inf;-%inf];
-conUB = [1;2;3;-1;2.5];
+conUB = [1;2;3;-1;2.5]';
 lb=[-1000;-10000; 0; -1000; -1000; -1000];
 ub=[10000; 100; 1.5; 100; 100; 1000];
 //and minimize 0.5*x'*Q*x + p'*x with
-p=[1; 2; 3; 4; 5; 6]'; Q=eye(6,6);
+p=[1; 2; 3; 4; 5; 6]; Q=eye(6,6);
 nbVar = 6;
 nbCon = 5;
 x0 = repmat(0,nbVar,1);
@@ -17,6 +18,6 @@ param = list("MaxIter", 300, "CpuTime", 100);
 [xopt,fopt,exitflag,output,lambda]=qpipopt(nbVar,nbCon,Q,p,lb,ub,conMatrix,conLB,conUB,x0,param)
 
 //Error
-//qpipopt: p should be a column vector 
-//at line     165 of function qpipopt called by :  
+//qpipopt: The Upper Bound should be a column vector 
+//at line     224 of function qpipopt called by :  
 //[xopt,fopt,exitflag,output,lambda]=qpipopt(nbVar,nbCon,Q,p,lb,ub,conMatrix,conLB,conUB,x0,param)
diff --git a/qpipopt/qpipopt_conLB1.sce b/qpipopt/qpipopt_conLB1.sce
index b613a57..09105e7 100644
--- a/qpipopt/qpipopt_conLB1.sce
+++ b/qpipopt/qpipopt_conLB1.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Checking if a user gives less or number of constraints Lower Bound
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_conLB2.sce b/qpipopt/qpipopt_conLB2.sce
index 3d23c83..d0236c0 100644
--- a/qpipopt/qpipopt_conLB2.sce
+++ b/qpipopt/qpipopt_conLB2.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Checking if a user gives a column vector
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_conMatrix1.sce b/qpipopt/qpipopt_conMatrix1.sce
index 9fd4daf..96ee3eb 100644
--- a/qpipopt/qpipopt_conMatrix1.sce
+++ b/qpipopt/qpipopt_conMatrix1.sce
@@ -1,4 +1,6 @@
 //Find x in R^6 such that:
+// Check if a user gives unequal number of constraints as given by him
+
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_conMatrix2.sce b/qpipopt/qpipopt_conMatrix2.sce
index b0caa80..f5e3106 100644
--- a/qpipopt/qpipopt_conMatrix2.sce
+++ b/qpipopt/qpipopt_conMatrix2.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+//Check for the size of constraints
 conMatrix= [-1,1,0,3,1;
 -1,0,-3,-4,5;
 2,5,3,0,1
diff --git a/qpipopt/qpipopt_conUB1.sce b/qpipopt/qpipopt_conUB1.sce
index 5434b6e..2c4bfa6 100644
--- a/qpipopt/qpipopt_conUB1.sce
+++ b/qpipopt/qpipopt_conUB1.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check for the Upper Bound of constraints is which should be equal to the number of constraints
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_conUB2.sce b/qpipopt/qpipopt_conUB2.sce
index ca8f0e7..33b3f2d 100644
--- a/qpipopt/qpipopt_conUB2.sce
+++ b/qpipopt/qpipopt_conUB2.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check for the Upper Bound of the constraints which should be a column vector 
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_input.sce b/qpipopt/qpipopt_input.sce
index fb0b86d..08bd468 100644
--- a/qpipopt/qpipopt_input.sce
+++ b/qpipopt/qpipopt_input.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check for the number of inputs
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_input2.sce b/qpipopt/qpipopt_input2.sce
index 2bbd111..decc8a8 100644
--- a/qpipopt/qpipopt_input2.sce
+++ b/qpipopt/qpipopt_input2.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the number of input is more
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_options1.sce b/qpipopt/qpipopt_options1.sce
index 2423764..6cebc51 100644
--- a/qpipopt/qpipopt_options1.sce
+++ b/qpipopt/qpipopt_options1.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+//Check if the user gives uneven number of parameters
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_options2.sce b/qpipopt/qpipopt_options2.sce
index b678add..ba5208b 100644
--- a/qpipopt/qpipopt_options2.sce
+++ b/qpipopt/qpipopt_options2.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the user gives different parameter other than predefined
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_options3.sce b/qpipopt/qpipopt_options3.sce
index f1c45ab..b267d77 100644
--- a/qpipopt/qpipopt_options3.sce
+++ b/qpipopt/qpipopt_options3.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the user for a list for the param
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_p1.sce b/qpipopt/qpipopt_p1.sce
index 9fb9112..eeeaed5 100644
--- a/qpipopt/qpipopt_p1.sce
+++ b/qpipopt/qpipopt_p1.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the user gives p matrix as a row vector 
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_p2.sce b/qpipopt/qpipopt_p2.sce
index b7d8f6f..2e9ed37 100644
--- a/qpipopt/qpipopt_p2.sce
+++ b/qpipopt/qpipopt_p2.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the user gives unequal size of 'p' as of the number of variables
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_x0.sce b/qpipopt/qpipopt_x0.sce
index 633b755..ef69b3d 100644
--- a/qpipopt/qpipopt_x0.sce
+++ b/qpipopt/qpipopt_x0.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the user gives initial guess matrix as a row vector 
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0
diff --git a/qpipopt/qpipopt_x02.sce b/qpipopt/qpipopt_x02.sce
index a30cc9e..52b0b89 100644
--- a/qpipopt/qpipopt_x02.sce
+++ b/qpipopt/qpipopt_x02.sce
@@ -1,4 +1,5 @@
 //Find x in R^6 such that:
+// Check if the user gives unequal size of initial guess as of the number of variables
 conMatrix= [1,-1,1,0,3,1;
 -1,0,-3,-4,5,6;
 2,5,3,0,1,0