PROGRAMAÇÃO LINEAR E O MÉTODO SIMPLEX: FUNDAMENTOS E APLICAÇÕES
PROGRAMAÇÃO LINEAR E O MÉTODO SIMPLEX: FUNDAMENTOS E APLICAÇÕES
-
DOI: https://doi.org/10.22533/at.ed.5832531031
-
Palavras-chave: Pesquisa Operacional, Otimização, Método Iterativo, Algoritmo Simplex.
-
Keywords: Operations Research, Optimization, Iterative Method, Simplex Algorithm.
-
Abstract: This study presents the fundamentals of linear programming and the mathematical formulation for solving optimization problems using the Simplex Method. Initially, the modeling and formulation of linear programming problems are discussed, highlighting constraints, decision variables, and the objective function. Subsequently, the Simplex algorithm is described, addressing its iterative structure, convergence criteria, and adaptation to the canonical model. The study also explores different solution approaches, such as graphical representation and algebraic resolution, illustrating the applicability of the method in obtaining optimal solutions for linear problems. To exemplify the procedure, a case study with a detailed resolution is presented, demonstrating the algorithm's steps until convergence to the optimal solution. The analysis of results confirms the effectiveness of the Simplex Method in solving optimization problems, underscoring its relevance to Operations Research and its applications in various fields.
- Joelson Lopes da Paixão