H.W. 1- Consider the problem of forming a maximum-area

H.W.
1- Consider the problem of forming a maximum-area rectangle out of a piece of wire of length 100 inches. Manually generate 1 iteration using uniform sample in the range (020) starting with a 4-inch rectangle base and using R=.7905. Next use the result as a starting solution for an additional normal sampling iteration with R= .9620.
2-
Given the distances between nodes:
d(12) = 5 d(13)=9 d(14)=8
d(25)=10 d(26)=17
d(35)=4 d(36)=10
d(45)=9 d(46)=9
d(57)=19
d(67)=9
Find the shortest path from node 1 to node 7 using dynamic programming employing backwards recursive equation.
Attachments: