next up previous
Next: DYNAMIC PROGRAMMING REQUIREMENTS Up: STRATEGY DYNAMIC PROGRAMMING Previous: Matrix Parenthesization Order

Work out

displaymath430

tex2html_wrap_inline544
tex2html_wrap_inline546
tex2html_wrap_inline548
=1200

tex2html_wrap_inline552
tex2html_wrap_inline554
tex2html_wrap_inline556
tex2html_wrap_inline558
tex2html_wrap_inline560
tex2html_wrap_inline562
=700

tex2html_wrap_inline566
tex2html_wrap_inline568
tex2html_wrap_inline570
tex2html_wrap_inline572
=min[0+10000+1*40*25,400+0+1*10*25]
=min[10100,650]=650

tex2html_wrap_inline578
tex2html_wrap_inline580
tex2html_wrap_inline582
tex2html_wrap_inline584
=min[0+250+40*10*1, 10000+0+40*25*1]
=min[650,-]=650

tex2html_wrap_inline590
tex2html_wrap_inline592
tex2html_wrap_inline594
=min[0+650+30*1*25,
1200+10000+30*40*25,
700+0+30*10*25]
=min[1400,-,-]=1400



Sushil Prasad
Thu May 13 13:06:05 EDT 1999