Aspectos computacionais de um algoritmo primal de direções viáveis para sistemas decomponíveis

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.

Grantor dc:publisher

Universidade Federal do Rio de Janeiro

Year dc:date.issued

1972

Author dc:creator

• Campos, Odival Juliano de

Advisor dc:contributor.advisor

• Gonzaga, Clóvis Caesar

• Algoritmos
• Programação não linear
• Engenharia de sistemas
• FORTRAN (Linguagem de programação de computador)

Statement dc:rights

• Acesso Aberto

Language dc:language

por

Handle dc:identifier.uri

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

OAI identifier oai:identifier

oai:pantheon.ufrj.br:11422/3755