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 (0,20) starting with a...

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 (0,20) 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(1,2) = 5, d(1,3)=9, d(1,4)=8



d(2,5)=10, d(2,6)=17



d(3,5)=4, d(3,6)=10



d(4,5)=9, d(4,6)=9



d(5,7)=19



d(6,7)=9



Find the shortest path from node 1 to node 7 using dynamic programming employing backwards recursive equation.


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 (0,20) 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(1,2) = 5, d(1,3)=9, d(1,4)=8 d(2,5)=10, d(2,6)=17 d(3,5)=4, d(3,6)=10 d(4,5)=9, d(4,6)=9 d(5,7)=19 d(6,7)=9 Find the shortest path from node 1 to node 7 using dynamic programming employing backwards recursive equation.