<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Simplex algorithm - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=simplex_algorithm&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=simplex_algorithm&amp;p=6">3.Next</a>
</p>
<p>tractable. Dantzig realized that one of the unsolved problems that he had mistaken as homework in his professor <a href="page.php?w=Jerzy_Neyman">Jerzy Neyman</a>'s class (and actually later solved), was applicable to finding an algorithm for linear programs. This problem involved finding the existence of <a href="page.php?w=Lagrange_multipliers">Lagrange multipliers</a> for general linear programs over a continuum of variables, each bounded between zero and one, and satisfying linear constraints expressed in the form of <a href="page.php?w=Lebesgue_integral">Lebesgue integral</a>s.</p><p>
<a accesskey="1" href="page.php?w=simplex_algorithm&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=simplex_algorithm&amp;p=6">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
