ࡱ>  Root Entry*0_^x Contents  Root Entry*0_^Contents  !"cao.txt') = x; \par \plain\f3\fs20\cf2 enddata\plain\f3\fs20\cf0 \par \par \plain\f3\fs20\cf2 end\plain\f3\fs20\cf0 \par } {\rtf1\ansi\deff0\deftab720{\fonttbl{\f0\fswiss MS Sans Serif;}{\f1\froman\fcharset2 Symbol;}{\f2\fswiss\fprq2 System;}{\f3\fmodern Courier New;}} {\colortbl\red0\green0\blue0;\red0\green175\blue0;\red0\green0\blue255;} \deflang1046\pard\plain\f3\fs20\cf2 model\plain\f3\fs20\cf0 : \par \plain\f3\fs20\cf2 title\plain\f3\fs20\cf0 Problema da Mochila; \par \par \plain\f3\fs20\cf2 sets\plain\f3\fs20\cf0 : \par objetos / 1..5 /: p, \plain\f3\fs20\cf1 ! benef\'edcio (profit) trazido por cada objeto;\plain\f3\fs20\cf0 \par w, \plain\f3\fs20\cf1 ! peso (weight) de cada objeto;\plain\f3\fs20\cf0 \par x; \plain\f3\fs20\cf1 ! vari\'e1vel de decis\'e3o. x(j) = 1 se o objeto j for alocado \'e0 mochila;\plain\f3\fs20\cf0 \par \plain\f3\fs20\cf2 endsets\plain\f3\fs20\cf0 \par \par \plain\f3\fs20\cf1 ! Leitura dos dados;\plain\f3\fs20\cf0 \par \plain\f3\fs20\cf2 data\plain\f3\fs20\cf0 : \par b = 60; \plain\f3\fs20\cf1 ! capacidade da mochila;\plain\f3\fs20\cf0 \par p = 100 60 70 15 15; \plain\f3\fs20\cf1 ! import\'e2ncia de cada objeto;\plain\f3\fs20\cf0 \par w = 52 23 35 15 7; \plain\f3\fs20\cf1 ! peso de cada objeto;\plain\f3\fs20\cf0 \par \plain\f3\fs20\cf2 enddata\plain\f3\fs20\cf0 \par \par [fo] \plain\f3\fs20\cf2 max\plain\f3\fs20\cf0 = \plain\f3\fs20\cf2 @sum\plain\f3\fs20\cf0 (objetos(j): p(j)*x(j)); \par \par \plain\f3\fs20\cf1 ! Os objetos postos na mochila n\'e3o podem ultrapassar sua capacidade;\plain\f3\fs20\cf  !"cao.txt') = x; \par \plain\f3\fs20\cf2 enddata\plain\f3\fs20\cf0 \par \par \plain\f3\fs20\cf2 end\plain\f3\fs20\cf0 \par } {\rtf1\ansi\deff0\deftab720{\fonttbl{\f0\fswiss MS Sans Serif;}{\f1\froman\fcharset2 Symbol;}{\f2\fswiss\fprq2 System;}{\f3\fmodern Courier New;}} {\colortbl\red0\green0\blue0;\red0\green175\blue0;\red0\green0\blue255;} \deflang1046\pard\plain\f3\fs20\cf2 model\plain\f3\fs20\cf0 : \par \plain\f3\fs20\cf2 title\plain\f3\fs20\cf0 Problema da Mochila; \par \par \plain\f3\fs20\cf2 sets\plain\f3\fs20\cf0 : \par objetos / 1..5 /: p, \plain\f3\fs20\cf1 ! benef\'edcio (profit) trazido por cada objeto;\plain\f3\fs20\cf0 \par w, \plain\f3\fs20\cf1 ! peso (weight) de cada objeto;\plain\f3\fs20\cf0 \par x; \plain\f3\fs20\cf1 ! vari\'e1vel de decis\'e3o. x(j) = 1 se o objeto j for alocado \'e0 mochila;\plain\f3\fs20\cf0 \par \plain\f3\fs20\cf2 endsets\plain\f3\fs20\cf0 \par \par \plain\f3\fs20\cf1 ! Leitura dos dados;\plain\f3\fs20\cf0 \par \plain\f3\fs20\cf2 data\plain\f3\fs20\cf0 : \par b = 60; \plain\f3\fs20\cf1 ! capacidade da mochila;\plain\f3\fs20\cf0 \par p = 100 60 70 15 15; \plain\f3\fs20\cf1 ! import\'e2ncia de cada objeto;\plain\f3\fs20\cf0 \par w = 52 23 35 15 7; \plain\f3\fs20\cf1 ! peso de cada objeto;\plain\f3\fs20\cf0 \par \plain\f3\fs20\cf2 enddata\plain\f3\fs20\cf0 \par \par [fo] \plain\f3\fs20\cf2 max\plain\f3\fs20\cf0 = \plain\f3\fs20\cf2 @sum\plain\f3\fs20\cf0 (objetos(j): p(j)*x(j)); \par \par \plain\f3\fs20\cf1 ! Os objetos postos na mochila n\'e3o podem ultrapassar sua capacidade;\plain\f3\fs20\cf0 \par [folgacap] \plain\f3\fs20\cf2 @sum\plain\f3\fs20\cf0 (objetos(j): w(j) * x(j)) <= b; \par \par \plain\f3\fs20\cf1 ! As vari\'e1veis s\'e3o bin\'e1rias;\plain\f3\fs20\cf0 \par \plain\f3\fs20\cf2 @for\plain\f3\fs20\cf0 (objetos(j): \plain\f3\fs20\cf2 @bin\plain\f3\fs20\cf0 (x(j))); \par \par \plain\f3\fs20\cf1 ! Exporta\'e7\'e3o da solu\'e7\'e3o para um arquivo texto;\plain\f3\fs20\cf0 \par \plain\f3\fs20\cf2 data\plain\f3\fs20\cf0 : \par \plain\f3\fs20\cf2 @text\plain\f3\fs20\cf0 ('solu