Content deleted Content added
m →Optimality conditions: ensp |
|||
Line 94:
==Numerical example==
Consider a linear program where
:<math>
\begin{align}
\boldsymbol{c} & =
\begin{bmatrix}
-2 & -3 & -4 & 0 & 0
\end{bmatrix}^{\mathrm{T}}\text{,} \\
\boldsymbol{A} & =
\begin{bmatrix}
3 & 2 & 1 & 1 & 0 \\
2 & 5 & 3 & 0 & 1
\end{bmatrix}\text{,} \\
\boldsymbol{b} & =
\begin{bmatrix}
10 \\
15
\end{bmatrix}\text{.}
\end{align}
</math>
Initially, {{math|'''''B''''' {{=}} ['''''A'''''<sub>4</sub> '''''A'''''<sub>5</sub>]}}, which corresponds to a feasible vertex {{math|'''''x''''' {{=}} [0 0 0 10 15]<sup>T</sup>}}.
==Practical issues==
| |||