Abstract
Linear programming problems are optimization problems where the objective function and constraints are linear. These are problems that seek to minimize or maximize the value of the objective function, i.e., looking for the best possible solution among all feasible solutions. We have as examples of optimization problems: revenue maximization, minimization of cost and maximizing resources. In this project a tool was built that allows us to obtain the solution to such problems in an automated way, and also features all the steps of applying the methods to the problem. The implemented methods are: the Simplex method, the Two-Phase method and the Dual Simplex method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
