lower bound, upper bound test added

18 files changed, 53 insertions, 53 deletions

diff --git a/help/en_US/lsqlin.xml b/help/en_US/lsqlin.xml
index 0904933..8887f30 100644
--- a/help/en_US/lsqlin.xml
+++ b/help/en_US/lsqlin.xml
@@ -38,17 +38,17 @@
    <title>Parameters</title>
    <variablelist>
    <varlistentry><term>C :</term>
-      <listitem><para> a matrix of double, represents the multiplier of the solution x in the expression C*x - d. Number of columns in C is equal to the number of elements in x.</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents the multiplier of the solution x in the expression C⋅x - d. Number of columns in C is equal to the number of elements in x.</para></listitem></varlistentry>
    <varlistentry><term>d :</term>
-      <listitem><para> a vector of double, represents the additive constant term in the expression C*x - d. Number of elements in d is equal to the number of rows in C matrix.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents the additive constant term in the expression C⋅x - d. Number of elements in d is equal to the number of rows in C matrix.</para></listitem></varlistentry>
    <varlistentry><term>A :</term>
-      <listitem><para> a vector of double, represents the linear coefficients in the inequality constraints</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</para></listitem></varlistentry>
    <varlistentry><term>b :</term>
-      <listitem><para> a vector of double, represents the linear coefficients in the inequality constraints</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</para></listitem></varlistentry>
    <varlistentry><term>Aeq :</term>
-      <listitem><para> a matrix of double, represents the linear coefficients in the equality constraints</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</para></listitem></varlistentry>
    <varlistentry><term>beq :</term>
-      <listitem><para> a vector of double, represents the linear coefficients in the equality constraints</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</para></listitem></varlistentry>
    <varlistentry><term>lb :</term>
       <listitem><para> a vector of double, contains lower bounds of the variables.</para></listitem></varlistentry>
    <varlistentry><term>ub :</term>
@@ -60,9 +60,9 @@
    <varlistentry><term>xopt :</term>
       <listitem><para> a vector of double, the computed solution of the optimization problem.</para></listitem></varlistentry>
    <varlistentry><term>resnorm :</term>
-      <listitem><para> a double, objective value returned as the scalar value norm(C*x-d)^2.</para></listitem></varlistentry>
+      <listitem><para> a double, objective value returned as the scalar value norm(C⋅x-d)^2.</para></listitem></varlistentry>
    <varlistentry><term>residual :</term>
-      <listitem><para> a vector of double, solution residuals returned as the vector d-C*x.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, solution residuals returned as the vector d-C⋅x.</para></listitem></varlistentry>
    <varlistentry><term>exitflag :</term>
       <listitem><para> The exit status. See below for details.</para></listitem></varlistentry>
    <varlistentry><term>output :</term>
diff --git a/help/en_US/lsqnonneg.xml b/help/en_US/lsqnonneg.xml
index 201e878..07cf7e6 100644
--- a/help/en_US/lsqnonneg.xml
+++ b/help/en_US/lsqnonneg.xml
@@ -35,15 +35,15 @@
    <title>Parameters</title>
    <variablelist>
    <varlistentry><term>C :</term>
-      <listitem><para> a matrix of double, represents the multiplier of the solution x in the expression C*x - d. Number of columns in C is equal to the number of elements in x.</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents the multiplier of the solution x in the expression C⋅x - d. Number of columns in C is equal to the number of elements in x.</para></listitem></varlistentry>
    <varlistentry><term>d :</term>
-      <listitem><para> a vector of double, represents the additive constant term in the expression C*x - d. Number of elements in d is equal to the number of rows in C matrix.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents the additive constant term in the expression C⋅x - d. Number of elements in d is equal to the number of rows in C matrix.</para></listitem></varlistentry>
    <varlistentry><term>xopt :</term>
       <listitem><para> a vector of double, the computed solution of the optimization problem.</para></listitem></varlistentry>
    <varlistentry><term>resnorm :</term>
-      <listitem><para> a double, objective value returned as the scalar value norm(C*x-d)^2.</para></listitem></varlistentry>
+      <listitem><para> a double, objective value returned as the scalar value norm(C⋅x-d)^2.</para></listitem></varlistentry>
    <varlistentry><term>residual :</term>
-      <listitem><para> a vector of double, solution residuals returned as the vector d-C*x.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, solution residuals returned as the vector d-C⋅x.</para></listitem></varlistentry>
    <varlistentry><term>exitflag :</term>
       <listitem><para> The exit status. See below for details.</para></listitem></varlistentry>
    <varlistentry><term>output :</term>
diff --git a/help/en_US/qpipopt.xml b/help/en_US/qpipopt.xml
index 170b457..a309a94 100644
--- a/help/en_US/qpipopt.xml
+++ b/help/en_US/qpipopt.xml
@@ -48,11 +48,11 @@
    <varlistentry><term>ub :</term>
       <listitem><para> a vector of double, contains upper bounds of the variables.</para></listitem></varlistentry>
    <varlistentry><term>A :</term>
-      <listitem><para> a matrix of double, contains the constraint matrix</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, contains the constraint matrix conLB ≤ A⋅x ≤ conUB.</para></listitem></varlistentry>
    <varlistentry><term>conLB :</term>
-      <listitem><para> a vector of double, contains lower bounds of the constraints.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, contains lower bounds of the constraints conLB ≤ A⋅x ≤ conUB.</para></listitem></varlistentry>
    <varlistentry><term>conUB :</term>
-      <listitem><para> a vector of double, contains upper bounds of the constraints.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, contains upper bounds of the constraints conLB ≤ A⋅x ≤ conUB.</para></listitem></varlistentry>
    <varlistentry><term>x0 :</term>
       <listitem><para> a vector of double, contains initial guess of variables.</para></listitem></varlistentry>
    <varlistentry><term>param :</term>
diff --git a/help/en_US/qpipoptmat.xml b/help/en_US/qpipoptmat.xml
index 82249a7..642971d 100644
--- a/help/en_US/qpipoptmat.xml
+++ b/help/en_US/qpipoptmat.xml
@@ -43,13 +43,13 @@
    <varlistentry><term>f :</term>
       <listitem><para> a vector of double, represents coefficients of linear in the quadratic problem</para></listitem></varlistentry>
    <varlistentry><term>A :</term>
-      <listitem><para> a vector of double, represents the linear coefficients in the inequality constraints</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</para></listitem></varlistentry>
    <varlistentry><term>b :</term>
-      <listitem><para> a vector of double, represents the linear coefficients in the inequality constraints</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</para></listitem></varlistentry>
    <varlistentry><term>Aeq :</term>
-      <listitem><para> a matrix of double, represents the linear coefficients in the equality constraints</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</para></listitem></varlistentry>
    <varlistentry><term>beq :</term>
-      <listitem><para> a vector of double, represents the linear coefficients in the equality constraints</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</para></listitem></varlistentry>
    <varlistentry><term>lb :</term>
       <listitem><para> a vector of double, contains lower bounds of the variables.</para></listitem></varlistentry>
    <varlistentry><term>ub :</term>
diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS b/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS
index 8323669..2a1feb2 100644
--- a/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS
+++ b/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS
diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS.TAB b/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS.TAB
index ba30e61..386e0dd 100644
--- a/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS.TAB
+++ b/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS.TAB
diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS b/help/en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS
index 6e8476f..465e052 100644
--- a/help/en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS
+++ b/help/en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS
diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/POSITIONS b/help/en_US/scilab_en_US_help/JavaHelpSearch/POSITIONS
index 9cd3f49..629f1cc 100644
--- a/help/en_US/scilab_en_US_help/JavaHelpSearch/POSITIONS
+++ b/help/en_US/scilab_en_US_help/JavaHelpSearch/POSITIONS
diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/SCHEMA b/help/en_US/scilab_en_US_help/JavaHelpSearch/SCHEMA
index f4e9ef7..dab0526 100644
--- a/help/en_US/scilab_en_US_help/JavaHelpSearch/SCHEMA
+++ b/help/en_US/scilab_en_US_help/JavaHelpSearch/SCHEMA
@@ -1,2 +1,2 @@
 JavaSearch 1.0
-TMAP bs=2048 rt=1 fl=-1 id1=1280 id2=1
+TMAP bs=2048 rt=1 fl=-1 id1=1279 id2=1
diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP b/help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP
index 12891d8..775c132 100644
--- a/help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP
+++ b/help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP
diff --git a/help/en_US/scilab_en_US_help/lsqlin.html b/help/en_US/scilab_en_US_help/lsqlin.html
index 7dbb227..db24b63 100644
--- a/help/en_US/scilab_en_US_help/lsqlin.html
+++ b/help/en_US/scilab_en_US_help/lsqlin.html
@@ -46,17 +46,17 @@
 
 <div class="refsection"><h3 class="title">Parameters</h3>
    <dl><dt><span class="term">C :</span>
-      <dd><p class="para">a matrix of double, represents the multiplier of the solution x in the expression C*x - d. Number of columns in C is equal to the number of elements in x.</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents the multiplier of the solution x in the expression C⋅x - d. Number of columns in C is equal to the number of elements in x.</p></dd></dt>
    <dt><span class="term">d :</span>
-      <dd><p class="para">a vector of double, represents the additive constant term in the expression C*x - d. Number of elements in d is equal to the number of rows in C matrix.</p></dd></dt>
+      <dd><p class="para">a vector of double, represents the additive constant term in the expression C⋅x - d. Number of elements in d is equal to the number of rows in C matrix.</p></dd></dt>
    <dt><span class="term">A :</span>
-      <dd><p class="para">a vector of double, represents the linear coefficients in the inequality constraints</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</p></dd></dt>
    <dt><span class="term">b :</span>
-      <dd><p class="para">a vector of double, represents the linear coefficients in the inequality constraints</p></dd></dt>
+      <dd><p class="para">a vector of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</p></dd></dt>
    <dt><span class="term">Aeq :</span>
-      <dd><p class="para">a matrix of double, represents the linear coefficients in the equality constraints</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</p></dd></dt>
    <dt><span class="term">beq :</span>
-      <dd><p class="para">a vector of double, represents the linear coefficients in the equality constraints</p></dd></dt>
+      <dd><p class="para">a vector of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</p></dd></dt>
    <dt><span class="term">lb :</span>
       <dd><p class="para">a vector of double, contains lower bounds of the variables.</p></dd></dt>
    <dt><span class="term">ub :</span>
@@ -68,9 +68,9 @@
    <dt><span class="term">xopt :</span>
       <dd><p class="para">a vector of double, the computed solution of the optimization problem.</p></dd></dt>
    <dt><span class="term">resnorm :</span>
-      <dd><p class="para">a double, objective value returned as the scalar value norm(C*x-d)^2.</p></dd></dt>
+      <dd><p class="para">a double, objective value returned as the scalar value norm(C⋅x-d)^2.</p></dd></dt>
    <dt><span class="term">residual :</span>
-      <dd><p class="para">a vector of double, solution residuals returned as the vector d-C*x.</p></dd></dt>
+      <dd><p class="para">a vector of double, solution residuals returned as the vector d-C⋅x.</p></dd></dt>
    <dt><span class="term">exitflag :</span>
       <dd><p class="para">The exit status. See below for details.</p></dd></dt>
    <dt><span class="term">output :</span>
diff --git a/help/en_US/scilab_en_US_help/lsqnonneg.html b/help/en_US/scilab_en_US_help/lsqnonneg.html
index a8e6801..8de3559 100644
--- a/help/en_US/scilab_en_US_help/lsqnonneg.html
+++ b/help/en_US/scilab_en_US_help/lsqnonneg.html
@@ -43,15 +43,15 @@
 
 <div class="refsection"><h3 class="title">Parameters</h3>
    <dl><dt><span class="term">C :</span>
-      <dd><p class="para">a matrix of double, represents the multiplier of the solution x in the expression C*x - d. Number of columns in C is equal to the number of elements in x.</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents the multiplier of the solution x in the expression C⋅x - d. Number of columns in C is equal to the number of elements in x.</p></dd></dt>
    <dt><span class="term">d :</span>
-      <dd><p class="para">a vector of double, represents the additive constant term in the expression C*x - d. Number of elements in d is equal to the number of rows in C matrix.</p></dd></dt>
+      <dd><p class="para">a vector of double, represents the additive constant term in the expression C⋅x - d. Number of elements in d is equal to the number of rows in C matrix.</p></dd></dt>
    <dt><span class="term">xopt :</span>
       <dd><p class="para">a vector of double, the computed solution of the optimization problem.</p></dd></dt>
    <dt><span class="term">resnorm :</span>
-      <dd><p class="para">a double, objective value returned as the scalar value norm(C*x-d)^2.</p></dd></dt>
+      <dd><p class="para">a double, objective value returned as the scalar value norm(C⋅x-d)^2.</p></dd></dt>
    <dt><span class="term">residual :</span>
-      <dd><p class="para">a vector of double, solution residuals returned as the vector d-C*x.</p></dd></dt>
+      <dd><p class="para">a vector of double, solution residuals returned as the vector d-C⋅x.</p></dd></dt>
    <dt><span class="term">exitflag :</span>
       <dd><p class="para">The exit status. See below for details.</p></dd></dt>
    <dt><span class="term">output :</span>
diff --git a/help/en_US/scilab_en_US_help/qpipopt.html b/help/en_US/scilab_en_US_help/qpipopt.html
index fc08a81..19b4e44 100644
--- a/help/en_US/scilab_en_US_help/qpipopt.html
+++ b/help/en_US/scilab_en_US_help/qpipopt.html
@@ -56,11 +56,11 @@
    <dt><span class="term">ub :</span>
       <dd><p class="para">a vector of double, contains upper bounds of the variables.</p></dd></dt>
    <dt><span class="term">A :</span>
-      <dd><p class="para">a matrix of double, contains the constraint matrix</p></dd></dt>
+      <dd><p class="para">a matrix of double, contains the constraint matrix conLB ≤ A⋅x ≤ conUB.</p></dd></dt>
    <dt><span class="term">conLB :</span>
-      <dd><p class="para">a vector of double, contains lower bounds of the constraints.</p></dd></dt>
+      <dd><p class="para">a vector of double, contains lower bounds of the constraints conLB ≤ A⋅x ≤ conUB.</p></dd></dt>
    <dt><span class="term">conUB :</span>
-      <dd><p class="para">a vector of double, contains upper bounds of the constraints.</p></dd></dt>
+      <dd><p class="para">a vector of double, contains upper bounds of the constraints conLB ≤ A⋅x ≤ conUB.</p></dd></dt>
    <dt><span class="term">x0 :</span>
       <dd><p class="para">a vector of double, contains initial guess of variables.</p></dd></dt>
    <dt><span class="term">param :</span>
diff --git a/help/en_US/scilab_en_US_help/qpipoptmat.html b/help/en_US/scilab_en_US_help/qpipoptmat.html
index 4a89648..5a6a5b6 100644
--- a/help/en_US/scilab_en_US_help/qpipoptmat.html
+++ b/help/en_US/scilab_en_US_help/qpipoptmat.html
@@ -51,13 +51,13 @@
    <dt><span class="term">f :</span>
       <dd><p class="para">a vector of double, represents coefficients of linear in the quadratic problem</p></dd></dt>
    <dt><span class="term">A :</span>
-      <dd><p class="para">a vector of double, represents the linear coefficients in the inequality constraints</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</p></dd></dt>
    <dt><span class="term">b :</span>
-      <dd><p class="para">a vector of double, represents the linear coefficients in the inequality constraints</p></dd></dt>
+      <dd><p class="para">a vector of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</p></dd></dt>
    <dt><span class="term">Aeq :</span>
-      <dd><p class="para">a matrix of double, represents the linear coefficients in the equality constraints</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</p></dd></dt>
    <dt><span class="term">beq :</span>
-      <dd><p class="para">a vector of double, represents the linear coefficients in the equality constraints</p></dd></dt>
+      <dd><p class="para">a vector of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</p></dd></dt>
    <dt><span class="term">lb :</span>
       <dd><p class="para">a vector of double, contains lower bounds of the variables.</p></dd></dt>
    <dt><span class="term">ub :</span>
diff --git a/help/en_US/scilab_en_US_help/symphony.html b/help/en_US/scilab_en_US_help/symphony.html
index d5b21cd..63c1db3 100644
--- a/help/en_US/scilab_en_US_help/symphony.html
+++ b/help/en_US/scilab_en_US_help/symphony.html
@@ -56,11 +56,11 @@
    <dt><span class="term">ub :</span>
       <dd><p class="para">a vector of double, represents upper bounds of the variables.</p></dd></dt>
    <dt><span class="term">A :</span>
-      <dd><p class="para">a matrix of double, represents  matrix representing the constraint matrix.</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents  matrix representing the constraint matrix conLB ≤ A⋅x ≤ conUB.</p></dd></dt>
    <dt><span class="term">conLB :</span>
-      <dd><p class="para">a vector of double, represents lower bounds of the constraints.</p></dd></dt>
+      <dd><p class="para">a vector of double, represents lower bounds of the constraints conLB ≤ A⋅x ≤ conUB.</p></dd></dt>
    <dt><span class="term">conUB :</span>
-      <dd><p class="para">a vector of double, represents upper bounds of the constraints</p></dd></dt>
+      <dd><p class="para">a vector of double, represents upper bounds of the constraints conLB ≤ A⋅x ≤ conUB.</p></dd></dt>
    <dt><span class="term">objSense :</span>
       <dd><p class="para">The sense (maximization/minimization) of the objective. Use 1(sym_minimize ) or -1 (sym_maximize) here.</p></dd></dt>
    <dt><span class="term">options :</span>
diff --git a/help/en_US/scilab_en_US_help/symphonymat.html b/help/en_US/scilab_en_US_help/symphonymat.html
index db8ffee..1f6af60 100644
--- a/help/en_US/scilab_en_US_help/symphonymat.html
+++ b/help/en_US/scilab_en_US_help/symphonymat.html
@@ -49,13 +49,13 @@
    <dt><span class="term">intcon :</span>
       <dd><p class="para">Vector of integer constraints, specified as a vector of positive integers. The values in intcon indicate the components of the decision variable x that are integer-valued. intcon has values from 1 through number of variable.</p></dd></dt>
    <dt><span class="term">A :</span>
-      <dd><p class="para">Linear inequality constraint matrix, specified as a matrix of double. A represents the linear coefficients in the constraints A*x ≤ b. A has the size where columns equals to the number of variables.</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</p></dd></dt>
    <dt><span class="term">b :</span>
-      <dd><p class="para">Linear inequality constraint vector, specified as a vector of double. b represents the constant vector in the constraints A*x ≤ b. b has size equals to the number of rows in A.</p></dd></dt>
+      <dd><p class="para">a vector of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</p></dd></dt>
    <dt><span class="term">Aeq :</span>
-      <dd><p class="para">Linear equality constraint matrix, specified as a matrix of double. Aeq represents the linear coefficients in the constraints Aeq*x = beq. Aeq has the size where columns equals to the number of variables.</p></dd></dt>
+      <dd><p class="para">a matrix of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</p></dd></dt>
    <dt><span class="term">beq :</span>
-      <dd><p class="para">Linear equality constraint vector, specified as a vector of double. beq represents the constant vector in the constraints Aeq*x = beq. beq has size equals to the number of rows in Aeq.</p></dd></dt>
+      <dd><p class="para">a vector of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</p></dd></dt>
    <dt><span class="term">lb :</span>
       <dd><p class="para">Lower bounds, specified as a vector or array of double. lb represents the lower bounds elementwise in lb ≤ x ≤ ub.</p></dd></dt>
    <dt><span class="term">ub :</span>
diff --git a/help/en_US/symphony.xml b/help/en_US/symphony.xml
index 68f1742..d11fafc 100644
--- a/help/en_US/symphony.xml
+++ b/help/en_US/symphony.xml
@@ -48,11 +48,11 @@
    <varlistentry><term>ub :</term>
       <listitem><para> a vector of double, represents upper bounds of the variables.</para></listitem></varlistentry>
    <varlistentry><term>A :</term>
-      <listitem><para> a matrix of double, represents  matrix representing the constraint matrix.</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents  matrix representing the constraint matrix conLB ≤ A⋅x ≤ conUB.</para></listitem></varlistentry>
    <varlistentry><term>conLB :</term>
-      <listitem><para> a vector of double, represents lower bounds of the constraints.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents lower bounds of the constraints conLB ≤ A⋅x ≤ conUB.</para></listitem></varlistentry>
    <varlistentry><term>conUB :</term>
-      <listitem><para> a vector of double, represents upper bounds of the constraints</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents upper bounds of the constraints conLB ≤ A⋅x ≤ conUB.</para></listitem></varlistentry>
    <varlistentry><term>objSense :</term>
       <listitem><para> The sense (maximization/minimization) of the objective. Use 1(sym_minimize ) or -1 (sym_maximize) here.</para></listitem></varlistentry>
    <varlistentry><term>options :</term>
diff --git a/help/en_US/symphonymat.xml b/help/en_US/symphonymat.xml
index 33ed973..32059cb 100644
--- a/help/en_US/symphonymat.xml
+++ b/help/en_US/symphonymat.xml
@@ -41,13 +41,13 @@
    <varlistentry><term>intcon :</term>
       <listitem><para> Vector of integer constraints, specified as a vector of positive integers. The values in intcon indicate the components of the decision variable x that are integer-valued. intcon has values from 1 through number of variable.</para></listitem></varlistentry>
    <varlistentry><term>A :</term>
-      <listitem><para> Linear inequality constraint matrix, specified as a matrix of double. A represents the linear coefficients in the constraints A*x ≤ b. A has the size where columns equals to the number of variables.</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</para></listitem></varlistentry>
    <varlistentry><term>b :</term>
-      <listitem><para> Linear inequality constraint vector, specified as a vector of double. b represents the constant vector in the constraints A*x ≤ b. b has size equals to the number of rows in A.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents the linear coefficients in the inequality constraints A⋅x ≤ b.</para></listitem></varlistentry>
    <varlistentry><term>Aeq :</term>
-      <listitem><para> Linear equality constraint matrix, specified as a matrix of double. Aeq represents the linear coefficients in the constraints Aeq*x = beq. Aeq has the size where columns equals to the number of variables.</para></listitem></varlistentry>
+      <listitem><para> a matrix of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</para></listitem></varlistentry>
    <varlistentry><term>beq :</term>
-      <listitem><para> Linear equality constraint vector, specified as a vector of double. beq represents the constant vector in the constraints Aeq*x = beq. beq has size equals to the number of rows in Aeq.</para></listitem></varlistentry>
+      <listitem><para> a vector of double, represents the linear coefficients in the equality constraints Aeq⋅x = beq.</para></listitem></varlistentry>
    <varlistentry><term>lb :</term>
       <listitem><para> Lower bounds, specified as a vector or array of double. lb represents the lower bounds elementwise in lb ≤ x ≤ ub.</para></listitem></varlistentry>
    <varlistentry><term>ub :</term>