若i=b,则 Chd +f,(d f2(6)=min c,+3())=min cie+f(e) i=d、e cb+∫3(f) 4+11 =min4+12}=14 2(b)=f 6+8
j b f c f f c f e c f d f b c f j b f b e b d i j j d e f = = + + + = + + + = + = = 14; ( ) 6 8 4 12 4 11 min ( ) ( ) ( ) ( ) min ( ) min * 2 3 3 3 3 , , 2 若i=b，则
若i=C,则 (-m1k+0m(+0 cc+ = mn =12;/2(c)=d 6+8
若i=c，则 j c d c f f c f d f c c f j cf cd i j j d f = = + + = + + = + = = 12; ( ) 6 8 1 11 min ( ) ( ) ( ) min ( ) min * 2 3 3 3 , 2
④当k=1时,i=sj=a或b,c; csa +(a) f(=min u+f2(]=min cb+f2(6) cs+f(c) 4+12 =min{3+14=16; (S)=a 11+12
j s a c f c c f b c f a f s c f j s c s b s a i j j a b c = = + + + = + + + = + = = 16; ( ) 11 12 3 14 4 12 min ( ) ( ) ( ) ( ) min ( ) min * 1 2 2 2 2 , , 1 当k=1时，i=s; j=a或b，c；
于是:从s地到地总运输费用最低的路线 (最优路线)是 saft,或 s, a, f, g, t; 最优策略是 P’=1(s)a,j2*(a)f,j*(0=g,j4*(g)=t; 目校 标函数最优值(最低总费用) R*-f1(s)=16
于是： 目标函数最优值（最低总费用） R*=f1 (s)=16 最优策略是 P*={j1*(s)=a，j2*(a)=f，j3*(f)=g，j4*(g)=t}; s a f g t，或 {s，a，f，g，t} ; 从s地到t地总运输费用最低的路线 （最优路线）是