Project created for study class - operational and logistical algorithms. Created within 1 day. Helps to plan means per product spent, when number of means is limited and our goal is to maximize profit. For resolving this issue we use Simplex Algorihtm (which is not implemented by myself)
Because of the speed, there are some bugs/ not great solutions you need to be aware: -reset doesn't work for all the cases -changing windows- doesn't work perfect -as input, program takes integers, so in case you would like to have floats, multiply everything by 10^n -not all output is catch by the GUI- as it was tested only for x1 and x2, however always you can check the output of a console
As this project is a speed run project, quality of code is bad, also I haven't tested the building of project. Due to start configuartion as Widget Project in VS I couldn't split solver code quickly, I dind't investigated it, that's why files are so long and awful looking. Language: polish only
Give accordingly number of products and number of means, these parameters will be used to create input table
Top row of the table- you can name the products. Left column- you can name means. Cells which have both product and mean- give means per 1 unit of product (integers), right column- limit of production, bottom row- profits per productClick Generuj tablice
Click Do wyniku
Products are placed accordingly to the table above, now give <= or >= and the number- you don't have to do it, but it let's you define bounds for number of product in output
Click Do wyniku
Funkcja celu- means goal function, next you have number of products under x1, x2 ... xn.
goal fun= profit_1* x1+ ..... profit_n+ xn ->maximize
So for example above it'll be
goal function= 30*x1+ 40*x2 -> maximize
equals:
170 000= 30*3000+ 40*2000
-> Create 3000 units of first product and 2000 units of second product