{"id":{"repo_id":"brazil-uerj","oai_identifier":"oai:pantheon.ufrj.br:11422/3713"},"canonical_url":"https://search.dev.ndltd.org/etd/brazil-uerj/oai:pantheon.ufrj.br:11422/3713","repository":{"repo_id":"brazil-uerj","name":"Brazil UERJ","base_url":"https://pantheon.ufrj.br/oai/request"},"display":{"title":"Programação contínua: propriedades das soluções","abstract":"This thesis is concerned with the Continuous Programming Problem, regarded as a continuous version of discrete problems in linear programming. First we treat the case in which the constraints are linear, in the space of bounded Lebesgue-measurable functions, presenting results involving extensive use of duality. To treat the case when the constraints are not linear, a continuous version of a \"Turnpiket\" theorem, used in Mathematical Economics for discrete processes, is derived. This theorem indicates the nature of the behavior of all optinal solutions when the process time is \"large\".","abstract_html":"This thesis is concerned with the Continuous Programming Problem, regarded as a continuous version of discrete problems in linear programming. First we treat the case in which the constraints are linear, in the space of bounded Lebesgue-measurable functions, presenting results involving extensive use of duality. To treat the case when the constraints are not linear, a continuous version of a "Turnpiket" theorem, used in Mathematical Economics for discrete processes, is derived. This theorem indicates the nature of the behavior of all optinal solutions when the process time is "large".","abstract_has_math":false,"creators":["Ortega, José Antônio"],"institution":"Universidade Federal do Rio de Janeiro","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Cunha, Nelson Ortegosa da"],"committee_chairs":[],"committee_members":[],"year":1971,"date_issued":"1971-11","date_published":"1971-11","updated_at":"2026-07-24T01:16:07Z","subjects":["Programação linear","Programação matemática","Otimização matemática","Engenharia de sistemas"],"languages":["por"],"rights":["Acesso Aberto"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11422/3713","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Cunha, Nelson Ortegosa da"]},{"key":"dc:creator","label":"Author","values":["Ortega, José Antônio"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-03-07T20:30:52Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-05-16T03:05:19Z"]},{"key":"dc:date.issued","label":"Date","values":["1971-11"]},{"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":["Programação linear","Programação matemática","Otimização matemática","Engenharia de sistemas"]}]},{"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/3713"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis is concerned with the Continuous Programming Problem, regarded as a continuous version of discrete problems in linear programming. First we treat the case in which the constraints are linear, in the space of bounded Lebesgue-measurable functions, presenting results involving extensive use of duality. To treat the case when the constraints are not linear, a continuous version of a \"Turnpiket\" theorem, used in Mathematical Economics for discrete processes, is derived. This theorem indicates the nature of the behavior of all optinal solutions when the process time is \"large\"."]},{"key":"dc:title","label":"Title","values":["Programação contínua: propriedades das soluções"]}]}],"canonical_facts":{"dc:contributor.advisor":["Cunha, Nelson Ortegosa da"],"dc:creator":["Ortega, José Antônio"],"dc:date.accessioned":["2018-03-07T20:30:52Z"],"dc:date.available":["2026-05-16T03:05:19Z"],"dc:date.issued":["1971-11"],"dc:description.abstract":["This thesis is concerned with the Continuous Programming Problem, regarded as a continuous version of discrete problems in linear programming. First we treat the case in which the constraints are linear, in the space of bounded Lebesgue-measurable functions, presenting results involving extensive use of duality. To treat the case when the constraints are not linear, a continuous version of a \"Turnpiket\" theorem, used in Mathematical Economics for discrete processes, is derived. This theorem indicates the nature of the behavior of all optinal solutions when the process time is \"large\"."],"dc:identifier.uri":["http://hdl.handle.net/11422/3713"],"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":["Programação linear","Programação matemática","Otimização matemática","Engenharia de sistemas"],"dc:title":["Programação contínua: propriedades das soluções"],"dc:type":["Dissertação"]},"updated_at":"2026-07-24T01:16:07Z"}