This rather complex algorithm was the latest subject in my Decision Mathematics 2 course at school. It involves taking a linear programming problem, and solving it without the need for graphical methods - the beauty of this is that it allows the logic to be extended to higher-dimensional problems which cannot easily be represented on multidimensional Cartesian coordinates. In fact, there is theoretically no limit to the number of variables that can be dealt with!
Anyway, the most important reason for the existence of the Simplex algorithm, as I see it, it that it can be more easily programmed into a computer. So this is what I did!
My C++ skills would seem rudimentary to a seasoned programmer, since I became a novice programmer several years ago and haven't touched an IDE since, but I'm quite pleased with the result of these 692 lines of code. It may spring bugs, but I have tested my version of the algorithm on the majority of the problems in the D1 and D2 textbooks and the results have been successful. This has allowed me to build on the pretty shocking SIMPLEX 1.0, developing a more robust SIMPLEX 2.0.
The various files can be found on my Dropbox:
- DevCPP source/project file (http://tinyurl.com/h7ck5ow)
- Readme in a text-file (http://tinyurl.com/gr4r56x)
- Executable SIMPLEX 2.0 file (http://tinyurl.com/zo8hbat)
Since the program is freshly programmed, it is likely that there will be faults in the code. Any error reports would be welcomed.
No comments:
Post a Comment