Programação contínua: propriedades das soluções

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".

Grantor dc:publisher

Universidade Federal do Rio de Janeiro

Year dc:date.issued

1971

Author dc:creator

• Ortega, José Antônio

Advisor dc:contributor.advisor

• Cunha, Nelson Ortegosa da

• Programação linear
• Programação matemática
• Otimização matemática
• Engenharia de sistemas

Statement dc:rights

• Acesso Aberto

Language dc:language

por

Handle dc:identifier.uri

http://hdl.handle.net/11422/3713

OAI identifier oai:identifier

oai:pantheon.ufrj.br:11422/3713