You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/src/apimanual.md
+18-16Lines changed: 18 additions & 16 deletions
Original file line number
Diff line number
Diff line change
@@ -864,7 +864,7 @@ read!(io, src_2)
864
864
### Duals
865
865
866
866
Conic duality is the starting point for MOI's duality conventions. When all functions are affine (or coordinate projections), and all constraint sets are closed convex cones, the model may be called a conic optimization problem.
867
-
For conic-form minimization problems, the primal is:
867
+
For a minimization problem in geometric conic form, the primal is:
868
868
869
869
```math
870
870
\begin{align}
@@ -874,7 +874,7 @@ For conic-form minimization problems, the primal is:
874
874
\end{align}
875
875
```
876
876
877
-
and the dual is:
877
+
and the dual is a maximization problem in standard conic form:
878
878
879
879
```math
880
880
\begin{align}
@@ -888,7 +888,7 @@ and the dual is:
888
888
889
889
where each ``\mathcal{C}_i`` is a closed convex cone and ``\mathcal{C}_i^*`` is its dual cone.
890
890
891
-
For conic-form maximization problems, the primal is:
891
+
For a maximization problem in geometric conic form, the primal is:
892
892
```math
893
893
\begin{align}
894
894
& \max_{x \in \mathbb{R}^n} & a_0^T x + b_0
@@ -897,7 +897,7 @@ For conic-form maximization problems, the primal is:
897
897
\end{align}
898
898
```
899
899
900
-
and the dual is:
900
+
and the dual is a minimization problem in standard conic form:
0 commit comments