chore: fix math formula.

Author: fuookami

README.md

@@ -48,7 +48,7 @@ This engineering practice is similar to <strong><em>Object-Oriented Design</em><
 Building upon the concept of arithmetic intermediate expressions, ospf can also encapsulate non-arithmetic expressions such as logical operations into intermediate expressions.
 
 $$
-FuncSymbol = \bigvee_{i} x_{i} = Or(x_{1}, \, x_{2}, \, .. \, , \, x_{i})
+FuncSymbol = \bigvee_{i} x_{i} = Or(x_{1}, \\, x_{2}, \\, .. \\, , \\, x_{i})
 $$
 
 $$
@@ -69,7 +69,7 @@ $$
 $$
 
 $$
-y \leq \sum_{i} x_{i}, \; \forall i
+y \leq \sum_{i} x_{i}, \\; \forall i
 $$
 
 $$

README_ch.md

@@ -47,7 +47,7 @@ ospf 会在将模型翻译到具体求解器的接口时，自动将把每个算
 基于算术中间值的思想，ospf 同样可以把类似逻辑运算表达式等非算术表达式封装到中间值中。
 
 $$
-FuncSymbol = \bigvee_{i} x_{i} = Or(x_{1}, \, x_{2}, \, .. \, , \, x_{i})
+FuncSymbol = \bigvee_{i} x_{i} = Or(x_{1}, \\, x_{2}, \\, .. \\, , \\, x_{i})
 $$
 
 $$
@@ -68,7 +68,7 @@ $$
 $$
 
 $$
-y \leq \sum_{i} x_{i}, \; \forall i
+y \leq \sum_{i} x_{i}, \\; \forall i
 $$
 
 $$

examples/ospf-kotlin-example/src/main/fuookami/ospf/kotlin/example/core_demo/doc.md

@@ -105,13 +105,13 @@ $$
 ##### (2) 企业是否被指派
 
 $$
-Assignment^{Company}_{c} = \sum_{p \in P}x_{cp}, \; \forall c \in C
+Assignment^{Company}_{c} = \sum_{p \in P}x_{cp}, \\; \forall c \in C
 $$
 
 ##### (3) 产品是否被指派
 
 $$
-Assignment^{Product}_{p} = \sum_{p \in P}x_{cp}, \; \forall p \in P
+Assignment^{Product}_{p} = \sum_{p \in P}x_{cp}, \\; \forall p \in P
 $$
 
 #### 3) 目标函数
@@ -127,13 +127,13 @@ $$
 ##### (1) 每个企业最多生产一个产品
 
 $$
-s.t. \quad Assignment^{Company}_{c} \leq 1, \; \forall c \in C
+s.t. \quad Assignment^{Company}_{c} \leq 1, \\; \forall c \in C
 $$
 
 ##### (2) 每个产品必须要被生产
 
 $$
-s.t. \quad Assignment^{Product}_{p} = 1, \; \forall p \in P
+s.t. \quad Assignment^{Product}_{p} = 1, \\; \forall p \in P
 $$
 
 ### 3. 期望结果