{"id":411,"date":"2015-03-09T19:40:55","date_gmt":"2015-03-09T22:40:55","guid":{"rendered":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/?page_id=411"},"modified":"2015-03-09T19:40:55","modified_gmt":"2015-03-09T22:40:55","slug":"programacao-matematica-i","status":"publish","type":"page","link":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/disciplinas-optativas\/programacao-matematica-i\/","title":{"rendered":"Programa\u00e7\u00e3o Matem\u00e1tica I"},"content":{"rendered":"<h4>Programa\u00e7\u00e3o Matem\u00e1tica I<\/h4>\n<p>&nbsp;<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"89\">Curso<\/td>\n<td width=\"548\">3800<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Disciplina<\/td>\n<td width=\"548\">Programa\u00e7\u00e3o matem\u00e1tica I<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Car\u00e1ter<\/td>\n<td width=\"548\">Optativa<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Pr\u00e9-requisito<\/td>\n<td width=\"548\">\u00c1lgebra Linear I<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">C\u00f3digo<\/td>\n<td width=\"548\">0100122<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Depto.<\/td>\n<td width=\"548\">DME<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">CHT<\/td>\n<td width=\"548\">68 horas\/aula<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Cr\u00e9ditos<\/td>\n<td width=\"548\">04<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Natureza<\/td>\n<td width=\"548\">34 te\u00f3rica \/ 34 Pr\u00e1tica<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Prof. Resp.<\/td>\n<td width=\"548\"><\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Objetivos<\/td>\n<td width=\"548\">\n<p>Geral: fornecer no\u00e7\u00f5es b\u00e1sicas de algumas t\u00e9cnicas em Pesquisa Operacional.<\/p>\n<p>Espec\u00edficos: habilitar o estudante \u00e0:<\/p>\n<p>Modelagem de problemas de otimiza\u00e7\u00e3o determin\u00edsticos;<\/p>\n<p>Identificar e resolver Problemas de Programa\u00e7\u00e3o Linear via M\u00e9todo Simplex;<\/p>\n<p>Identificar e resolver problemas de pequeno porte de fluxo em rede;<\/p>\n<p>Modelagem de processos de tomada de decis\u00e3o via teoria de jogos;<\/p>\n<p>Modelagem de processos de tomada de decis\u00e3o via programa\u00e7\u00e3o din\u00e2mica.<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Ementa<\/td>\n<td width=\"548\">Programa\u00e7\u00e3o Linear. Tipos Especiais de problemas de Programa\u00e7\u00e3o Linear. Modelos determin\u00edsticos: programa\u00e7\u00e3o de metas, an\u00e1lise de redes (PERT-CPM). Programa\u00e7\u00e3o Din\u00e2mica. Teoria dos Jogos.<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Programa<\/td>\n<td width=\"548\">\n<p><strong>Preliminares<\/strong><\/p>\n<p>Programa\u00e7\u00e3o Matem\u00e1tica no contexto da Pesquisa Operacional;<\/p>\n<p>Sistemas de Equa\u00e7\u00f5es Lineares;<\/p>\n<p>Espa\u00e7os Vetoriais;<\/p>\n<p>Conjuntos Convexos;<\/p>\n<p>Fun\u00e7\u00f5es Convexas;<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Programa\u00e7\u00e3o Linear<\/strong><\/p>\n<p>Modelos, Exemplos;<\/p>\n<p>Forma Padr\u00e3o de um PPL;<\/p>\n<p>Solu\u00e7\u00e3o Gr\u00e1fica;<\/p>\n<p>Introdu\u00e7\u00e3o \u00e0 Dualidade e \u00e0 an\u00e1lise de Sensibilidade;<\/p>\n<p>M\u00e9todo Simplex;<\/p>\n<p>Algumas Aplica\u00e7\u00f5es:<\/p>\n<p>Problema de Transporte;<\/p>\n<p>Problema de Aloca\u00e7\u00e3o;<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Programa\u00e7\u00e3o em Redes (an\u00e1lise de redes)<\/strong><\/p>\n<p>Terminologia (Alguns conceitos em Teoria de Grafos);<\/p>\n<p>Problema de Fluxo (em Rede) de Custo M\u00ednimo;<\/p>\n<p>Problema de Fluxo de Custo M\u00e1ximo e Menor Caminho;<\/p>\n<p>Planejamento e Controle de Projetos com PERT-CPM.<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Introdu\u00e7\u00e3o \u00e0 Teoria dos Jogos<\/strong><\/p>\n<p>Exemplos:<\/p>\n<p>Jogos de duas Pessoas<\/p>\n<p>Jogos de soma- zero<\/p>\n<p>Jogos de soma n\u00e3o-zero;<\/p>\n<p>Jogos de n-pessoas;<\/p>\n<p>&#8211; No\u00e7\u00f5es de teoria de Utilidade.<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Programa\u00e7\u00e3o Din\u00e2mica<\/strong><\/p>\n<p>Prot\u00f3tipo;<\/p>\n<p>Caracter\u00edsticas dos problemas de programa\u00e7\u00e3o Din\u00e2mica;<\/p>\n<p>Modelos de programa\u00e7\u00e3o Din\u00e2mica determin\u00edstica;<\/p>\n<p>Programa\u00e7\u00e3o Din\u00e2mica Probabil\u00edstica.<\/td>\n<\/tr>\n<tr>\n<td width=\"89\">Bibliografia<\/td>\n<td width=\"548\">\n<p>B\u00e1sica<\/p>\n<p>BAZARAA, M. S. Ad JARVIS, J. J. Linear programming and network flows.<\/p>\n<p>New York. John Wiley &amp; Sons, 1990.<\/p>\n<p>BREGALDA, Paulo F. et alli. Introdu\u00e7\u00e3o \u00e0 programa\u00e7\u00e3o linear, Rio de Janeiro.<\/p>\n<p>BRONSON, Richard. Pesquisa Operacional. S\u00e3o Paulo, MacGraw-Hill, 1985.<\/p>\n<p>HILLIER, F. S. and LIBERMAN , G. J. Introdu\u00e7\u00e3o \u00e0 pesquisa operacional. Rio de janeiro, Campus e Universidade de S\u00e3o Paulo.<\/p>\n<p>HIRSCHFElD, Henrique . Planejamento com PERT-CPM e an\u00e1lise de desempenho.<\/p>\n<p>KAUFMANN, Arnold. A ci\u00eancia da tomada de decis\u00e3o. Rio de Janeiro, Zahar, 1981.<\/p>\n<p>LUENBERGER, David G. Linear and nonlinear programming. 2nd Edition. Addison-Wesley, 1984.<\/p>\n<p>RARDIN,Ronald L. Optimization in operations research. New Jersey, Prentice-Hall, 1998.<\/p>\n<p>SILVA, Ermes M. et alli. Pesquisa operacional para os cursos de economia, administra\u00e7\u00e3o e ci\u00eancias cont\u00e1beis. S\u00e3o Paulo, Atlas, 1995.<\/p>\n<p>SZWARCFITER, Jaime L. Grafos e algoritmos computacionais. Rio de Janeiro, Campus, 1984.<\/p>\n<p>&nbsp;<\/p>\n<p>Complementar<\/p>\n<p>WAGNER, Harvey M. Pesquisa operacional. Rio de Janeiro, Prentice-Hall, 1985.<\/p>\n<p>&nbsp;<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Programa\u00e7\u00e3o Matem\u00e1tica I &nbsp; Curso 3800 Disciplina Programa\u00e7\u00e3o matem\u00e1tica I Car\u00e1ter Optativa Pr\u00e9-requisito \u00c1lgebra Linear I C\u00f3digo 0100122 Depto. DME CHT 68 horas\/aula Cr\u00e9ditos 04 Natureza 34 te\u00f3rica \/ 34 Pr\u00e1tica Prof. Resp. Objetivos Geral: fornecer no\u00e7\u00f5es b\u00e1sicas de algumas t\u00e9cnicas em Pesquisa Operacional. Espec\u00edficos: habilitar o estudante \u00e0: Modelagem de problemas de otimiza\u00e7\u00e3o determin\u00edsticos; [&hellip;]<\/p>\n","protected":false},"author":466,"featured_media":0,"parent":363,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-sem-sidebar.php","meta":{"jetpack_post_was_ever_published":false,"footnotes":""},"class_list":["post-411","page","type-page","status-publish","hentry"],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/P7sk8J-6D","_links":{"self":[{"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages\/411","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/users\/466"}],"replies":[{"embeddable":true,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/comments?post=411"}],"version-history":[{"count":1,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages\/411\/revisions"}],"predecessor-version":[{"id":412,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages\/411\/revisions\/412"}],"up":[{"embeddable":true,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages\/363"}],"wp:attachment":[{"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/media?parent=411"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}