Laserfiche WebLink
<br />I <br /> <br />I <br /> <br />I <br /> <br />Minimize V = <br /> <br />Me <br />~ <br />~ <br /> <br />rjl; (,'1.) <br />oJ J <br /> <br />N <br /> <br />j=l <br /> <br />I <br /> <br />v - total uncertainty in the net'..;ork <br />N - vector of annual number tiI:1es each route was used <br />MG - number of gages in the net'"ork <br /> <br />. <br /> <br />~. annual number of visits to station j <br /> <br />. <br /> <br />M. <br />J <br />$.. - <br />oj <br /> <br />function relating number or visits to <br />at station j <br /> <br />uncertainty <br /> <br />. <br /> <br />Such that <br />Budget > <br /> <br />I <br /> <br />T = F + <br />c c <br /> <br />Xc :total cost of operating the network <br /> <br />MG <br />I: a.M. + <br />j=l J J <br /> <br />NR <br />I: S.N. <br />. 1 1- 1-' <br />1-= <br /> <br />" <br />" <br /> <br />. <br /> <br /> F - fixed cost <br /> c <br /> 0.. - unit cost of visit to station J <br /> J " -.,., (, <br /> NR - number of practical routes chosen <br /> S. travel for i .'., <br /> - COSt route <br /> 't. <br /> N. - annual number times route i is'u$~d <br /> 't. (an element of !!.) <br />and such that <br /> M. > ^ . <br /> J - J <br /> ^ . - minimum number of annual visits to station J <br /> J <br /> <br />. <br /> <br />I <br /> <br />. <br /> <br />. <br /> <br />I <br /> <br />.' <br /> <br />Figure 2.--~~thematical programming form of the optimization <br />of the routing of hydrog~aphers. <br /> <br />. <br /> <br />. <br /> <br />I <br /> <br />I <br /> <br />11 <br />