Simplex multiobjetivo: um estudo a respeito das adaptações ao método Simplex para problemas de programação linear multiobjetivo
This work presents a study about Multiobjective Linear Programming (MOLP) which highlights, adapted to the classic Simplex Method, the Multiobjective Simplex in solving problems from the PLMO. The Multiobjective Simplex, with the aid of Paretooptimality results, acts in order to generate the set...
| Autor principal: | Almeida, Felipe Azevedo de |
|---|---|
| Grau: | Trabalho de Conclusão de Curso |
| Idioma: | por |
| Publicado em: |
Brasil
2022
|
| Assuntos: | |
| Acesso em linha: |
http://riu.ufam.edu.br/handle/prefix/6341 |
| Resumo: |
|---|
|
This work presents a study about Multiobjective Linear Programming (MOLP) which
highlights, adapted to the classic Simplex Method, the Multiobjective Simplex in solving
problems from the PLMO. The Multiobjective Simplex, with the aid of Paretooptimality
results, acts in order to generate the set of all Pareto-optimal solutions
(or non-dominated solutions) that are extreme points of the viable set of the problem
together with the execution of a subroutine of non-dominance — developed by Yu e
Zeleny (1974) — to test the non-dominance of any extreme solution (basic viable solution)
found in order to make the problem closer to reality taking into account all the
objectives of interest. |