Paul Kilpatrick

Email: <kilpatrick AT acm DOT org>

{us}

{
      $ \mathit{kappa} := 0 ; \hspace{0.222222em}\mathrm{for}\hspace{0.222222em}i := 0\hspace{0.222222em}\mathrm{step}\hspace{0.222222em}1\hspace{0.222222em}\mathrm{until}\hspace{0.222222em}n - 1\hspace{0.222222em}\mathrm{do}\hspace{0.222222em}d [ i ]  := 0 ;  $ 

}
     
     
       $ \mathrm{for}\hspace{0.222222em}i := 0\hspace{0.222222em}\mathrm{step}\hspace{0.222222em}1\hspace{0.222222em}\mathrm{until}\hspace{0.222222em}n - 1\hspace{0.222222em}\mathrm{do} $
     
       
     
       $ \mathrm{begin}\hspace{0.222222em}d [ i ]  := 1 $ 
     
       
{
    \leftskip10mm $ \mathrm{if}\hspace{0.222222em}i \ge 1\hspace{0.222222em}\mathrm{then}\hspace{0.222222em}d [ i - 1 ]  := 0 ;  $ 

}
     
{
    \leftskip10mm $ \mathit{linprog} ( m , n , \mathit{kappa} , G , b , d , x , z , \mathit{ind} , \mathit{infeas} , \mathit{unbdd} , \mathit{sing} )  ;  $ 

}
     
{
    \leftskip10mm $ \mathit{upper}\hspace{0.222222em}\mathit{bound} [ i ]  := z ;  $ 

}
     
     
       $ \mathrm{end} ;  $


CategoryHomepage

PaulKilpatrick (last edited 2008-12-08 10:45:29 by )