In this repository you will find the code for the solver of maximize and minimize problems. This solver use the graphic method.
The graphical method consists of representing the graphs associated with the equations of the system to deduce their solution. The solution of the system is the point of intersection between the graphs. The reason for this is that the coordinates of this point satisfy both equations and, therefore, it is the solution of the system.
The program consist of the following steps:
- Choose an excercise and put it into the Excercise.csv
- Read the CSV file with a standardized text with
input()
- Parse the information saved from the read before with
ParseExcercises(reuturnOfInput())
- Call
solver(returnOfParseExcercises())
- Run the program
- The program was made to analyze N number of restrictions in just ONE excercises, each of them with a similar look (only two variables of decission).
- It will only accept problems that achieve the terms of solutions given by the graphic method solver
Every text must be like the following example:
Despite criterio;max does not have any functionality within the code, its a need to be given, this just for keep the structure of work defined.
You will see another file called Excercises.txt. It contain other two differents examples. If you want to use them, choose one and copy/paste it in Excercises.csv .