<< Click here to display Table of Contents >> Navigation: LINGO 15.0 Users Manual > Developing More Advanced Models > Logistics Models > Shortest Route Problem Model: DYNAMB:
The Formulas
The recursion, discussed above, is entered in LINGO with the following statement:
@FOR( CITIES( i)| i #LT# @SIZE( CITIES):
F( i) = @MIN( ROADS( i, j): D( i, j) + F( j))
);