Implementação de um algoritmo dual para a otimização de sistemas decomponíveis

This work deals with the optimization of decomposable systems. A decomposable mathematical programming problem is proposed ans its solution is achieved by means of dual coordination. Two basic concepts arising in large scale mathematical programming are used: outer linearization and relaxation. A cutting plane algorithm without nested constraint sets is sinthetized based on results from duality theory. Its appication to the outer linearized problem results in a convergent method for the solution of the original problem. A computer program has been developed.

Grantor dc:publisher

Universidade Federal do Rio de Janeiro

Year dc:date.issued

1972

Author dc:creator

• Lopes Filho, Dilermando Ferreira

Advisor dc:contributor.advisor

• Gonzaga, Clóvis Caesar

• Algoritmos
• Programação matemática
• Otimização matemática

Statement dc:rights

• Acesso Aberto

Language dc:language

por

Handle dc:identifier.uri

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

OAI identifier oai:identifier

oai:pantheon.ufrj.br:11422/3760