Uma aplicação em java do método simplex

Abstract

Linear programming is a problem solving technique focused on the use of linear mathematical models, using the Simplex method to solve problems and obtain the optimal solution. In this monograph, an exploratory, bibliographic study is made, which aims to develop an application, made in Java, that performs the procedures of the Simplex method to maximize linear programming problems. The result of this study proved to be satisfactory, because with the application of procedures performed in a computational way it is possible to obtain more reliable solutions in a shorter period of time. The application works with some limitations for the vast majority of problems that are proposed for this level of depth in the topic. In summary, we reiterate the importance of working with the theoretical and practical concepts of linear programming that is part of the range of options that exist within computational mathematics, with this, it is concluded that the study is important to assist students who show interest in learning techniques linear programming and encourage research on the topic.