A program for solving linear programming problems by the dual simplex method. Sources in Microsoft Visual C# with detailed comments. Flowcharts, as well as term paper written for this program. Rented for 5.
The program itself constitutes a dual task and brings it to the canonical form. Displays a detailed report on the progress of the task. It is possible to solve both dual and direct problems, and quickly switch between them for a more detailed analysis and study of the problem.
There are three problem solving modes:
1) Automatic
2) Step by step
3) Manual
In the first mode, the program itself chooses the resolving column and row, which provide the maximum increase or decrease in the objective function. It also automatically recalculates all tables.
In step mode, each recalculated table is displayed. This mode is convenient for viewing intermediate results of solving a problem. The allowing column and line, in this mode, the program also chooses itself.
In manual mode, the user selects the permissive row and column.
-----------------------------------------------------
Archive content:
1) Program (exe file)
2) Sources in Microsoft Visual C#
3) Sources of a simplified version of the program in Microsoft Visual C#
4) Coursework (47 sheets, submitted for 5)
5) Block diagrams of the program algorithm (6 sheets)
6) Help file containing a detailed description of how to work with the program
7) Several examples of calculation in the program.
The archive contains two versions of the program with source codes. The first is more complex, with a more complex interface. The second program "simplex_lite" is a light version of the first one. There is only a function of recalculating the table, and displaying the solution. Minimum code. This version is suitable for students who need a simple solution to the problem, and nothing more.
No feedback yet