Icy Version 1.5.4.2
Java(TM) SE Runtime Environment 1.7.0_67-b01 (64 bit)
Running on Windows 8.1 6.3 (amd64)
Max java memory : 3584.0 MB

Java(TM) SE Runtime Environment 1.7.0_67-b01 (64 bit)
Running on Windows 8.1 6.3 (amd64)
Number of processors : 8
System total memory : 8075.1 MB
System available memory : 3888.3 MB
Max java memory : 3584.0 MB

VTK library successfully loaded…

Icy Version 1.5.4.2 started !

=== Linear Programming test scenario 0 ===

Basic example with 3 pivots
Optimal score is 6.5
Solution is [1.0, 1.0, 0.5, 0.0]

Linear Programming problem:

max_x – 2.0*x[0] + 4.0*x[1] + 1.0*x[2] + 1.0*x[3]

Such that x >= 0 and:

– 2.0*x[0] + 1.0*x[0] + 0.0*x[0] + 0.0*x[0] <= 3.0 - 0.0*x[1] + 1.0*x[1] + 4.0*x[1] + 1.0*x[1] <= 3.0 - 1.0*x[2] + 3.0*x[2] + 0.0*x[2] + 1.0*x[2] <= 4.0 Computed solution = [1.0, 1.0, 0.5, 0.0, ] Computed score = 6.5 Computed constraint values: 3.0 <= 3.0 3.0 <= 3.0 4.0 <= 4.0 === Linear Programming test scenario 1 === Example that would cycle with Bland rule. Optimal score is 1/20. Solution is [1/25, 0, 1, 0]. Linear Programming problem: max_x - 0.75*x[0] - 150.0*x[1] + 0.02*x[2] - 6.0*x[3] Such that x >= 0 and:

– 0.25*x[0] – 60.0*x[0] – 0.04*x[0] + 9.0*x[0] <= 0.0 - 0.5*x[1] - 90.0*x[1] - 0.02*x[1] + 3.0*x[1] <= 0.0 - 0.0*x[2] + 0.0*x[2] + 1.0*x[2] + 0.0*x[2] <= 1.0 Computed solution = [0.04, 0.0, 1.0, 0.0, ] Computed score = 0.05 Computed constraint values: -0.03 <= 0.0 0.0 <= 0.0 1.0 <= 1.0 === Linear Programming test scenario 2 === An example with equality constraints Solution is [0, 4/7, 1 + 5/7, 0, 0]. Linear Programming problem: min_x - 1.0*x[0] + 6.0*x[1] - 7.0*x[2] + 1.0*x[3] + 5.0*x[4] Such that x >= 0 and:

– 5.0*x[0] – 4.0*x[0] + 13.0*x[0] – 2.0*x[0] + 1.0*x[0] = 20.0
– 1.0*x[1] – 1.0*x[1] + 5.0*x[1] – 1.0*x[1] + 1.0*x[1] = 8.0

Computed solution = [0.0, 0.571428571428571, 1.7142857142857142, 0.0, 0.0, ]

Computed score = -8.571428571428573

Computed constraint values:
20.0 == 20.0
8.0 == 8.0