{"id":{"repo_id":"brazil-uerj","oai_identifier":"oai:pantheon.ufrj.br:11422/3755"},"canonical_url":"https://search.dev.ndltd.org/etd/brazil-uerj/oai:pantheon.ufrj.br:11422/3755","repository":{"repo_id":"brazil-uerj","name":"Brazil UERJ","base_url":"https://pantheon.ufrj.br/oai/request"},"display":{"title":"Aspectos computacionais de um algoritmo primal de direções viáveis para sistemas decomponíveis","abstract":"A primal feasible directions algorithm is studied to optimize non-linear decomposable systems. In the course of these studies some known results are formalized and proved, and economical interpretations are developed. A criterion is derived to detect the different hability of the pertubation functions involved in the algorithm, and this property is used with some computational advantages. The concept of Ɛ-activity of constraints is discussed, and related to the convergente of the algorithm. Finally, a FORTRAN IV subroutine is presented capable of finding a feasible direction in each iteration of the algorithm.","abstract_html":"A primal feasible directions algorithm is studied to optimize non-linear decomposable systems. In the course of these studies some known results are formalized and proved, and economical interpretations are developed. A criterion is derived to detect the different hability of the pertubation functions involved in the algorithm, and this property is used with some computational advantages. The concept of Ɛ-activity of constraints is discussed, and related to the convergente of the algorithm. Finally, a FORTRAN IV subroutine is presented capable of finding a feasible direction in each iteration of the algorithm.","abstract_has_math":false,"creators":["Campos, Odival Juliano de"],"institution":"Universidade Federal do Rio de Janeiro","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Gonzaga, Clóvis Caesar"],"committee_chairs":[],"committee_members":[],"year":1972,"date_issued":"1972-09","date_published":"1972-09","updated_at":"2026-07-24T01:16:10Z","subjects":["Algoritmos","Programação não linear","Engenharia de sistemas","FORTRAN (Linguagem de programação de computador)"],"languages":["por"],"rights":["Acesso Aberto"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11422/3755","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Gonzaga, Clóvis Caesar"]},{"key":"dc:creator","label":"Author","values":["Campos, Odival Juliano de"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-03-16T19:13:47Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-05-16T03:05:21Z"]},{"key":"dc:date.issued","label":"Date","values":["1972-09"]},{"key":"dc:publisher","label":"Institution","values":["Universidade Federal do Rio de Janeiro"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia"]},{"key":"dc:type","label":"Dc Type","values":["Dissertação"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Algoritmos","Programação não linear","Engenharia de sistemas","FORTRAN (Linguagem de programação de computador)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["por"]},{"key":"dc:rights","label":"Dc Rights","values":["Acesso Aberto"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11422/3755"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A primal feasible directions algorithm is studied to optimize non-linear decomposable systems. In the course of these studies some known results are formalized and proved, and economical interpretations are developed. A criterion is derived to detect the different hability of the pertubation functions involved in the algorithm, and this property is used with some computational advantages. The concept of Ɛ-activity of constraints is discussed, and related to the convergente of the algorithm. Finally, a FORTRAN IV subroutine is presented capable of finding a feasible direction in each iteration of the algorithm."]},{"key":"dc:title","label":"Title","values":["Aspectos computacionais de um algoritmo primal de direções viáveis para sistemas decomponíveis"]}]}],"canonical_facts":{"dc:contributor.advisor":["Gonzaga, Clóvis Caesar"],"dc:creator":["Campos, Odival Juliano de"],"dc:date.accessioned":["2018-03-16T19:13:47Z"],"dc:date.available":["2026-05-16T03:05:21Z"],"dc:date.issued":["1972-09"],"dc:description.abstract":["A primal feasible directions algorithm is studied to optimize non-linear decomposable systems. In the course of these studies some known results are formalized and proved, and economical interpretations are developed. A criterion is derived to detect the different hability of the pertubation functions involved in the algorithm, and this property is used with some computational advantages. The concept of Ɛ-activity of constraints is discussed, and related to the convergente of the algorithm. Finally, a FORTRAN IV subroutine is presented capable of finding a feasible direction in each iteration of the algorithm."],"dc:identifier.uri":["http://hdl.handle.net/11422/3755"],"dc:language":["por"],"dc:publisher":["Universidade Federal do Rio de Janeiro"],"dc:publisher.department":["Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia"],"dc:rights":["Acesso Aberto"],"dc:subject":["Algoritmos","Programação não linear","Engenharia de sistemas","FORTRAN (Linguagem de programação de computador)"],"dc:title":["Aspectos computacionais de um algoritmo primal de direções viáveis para sistemas decomponíveis"],"dc:type":["Dissertação"]},"updated_at":"2026-07-24T01:16:10Z"}