Gauß Demonstration

On this page you find a small Java application to demonstrates the steps of the Gauß algorithm. It can also be used to solve linear problems with the simplex algorithm.

The following is a short introduction.

Here is an example for a final tableau.

The input format is very simple.

Example:

; Maximize x+3y under the conditins
; x+y <= 4, x+2y <= 5, y <= 2
; Thus we get the equations
; x+y+s1=4, x+2y+s2=5, y+s3=2
;
x y s1 s2 s3
1 1 1 0 0 4
1 2 0 1 0 5
0 1 0 0 1 2
1 3

Download the program as a zipped archive. Extract all files, and start the program by double clicking on "gausser.jar". The source is available. The program may be published elsewhere only with my permission.