+ 4 │ 0 -1/4 1/4 0 0 1 6</code></pre><p>To manually solve a linear program, use <code>pivot!</code> at each step so the <code>Tableau</code> is modified by the operation. </p><h2 id="Solving-the-LP"><a class="docs-heading-anchor" href="#Solving-the-LP">Solving the LP</a><a id="Solving-the-LP-1"></a><a class="docs-heading-anchor-permalink" href="#Solving-the-LP" title="Permalink"></a></h2><h3 id="Solution-by-pivoting"><a class="docs-heading-anchor" href="#Solution-by-pivoting">Solution by pivoting</a><a id="Solution-by-pivoting-1"></a><a class="docs-heading-anchor-permalink" href="#Solution-by-pivoting" title="Permalink"></a></h3><blockquote><p><strong>Note</strong>: As of this release, this mostly works; however, it may reach a maximum number of iterations without finding an optimal solution. Also, if the LP is unbounded or infeasible, it will likely fail. </p></blockquote><p>The function <code>pivot_solve</code> produces the optimal solution to the LP. </p><pre><code class="nohighlight hljs">julia> pivot_solve(T)
0 commit comments