Test Data for Simplex project.
Below are three sample inputs 
testing various cases for the 
simplex algorithm.

"unbounded":
Sample input:
---------------------------
3 2
5.0 1.0 >= 5.0
1.0 1.0 >= 3.0
1.0 5.0 >= 5.0
maximize 1.0 2.0
---------------------------
Sample output:
UNBOUNDED
5.0 0.0



"no feasible solution":
Sample input:
---------------------------
3 2
5.0 1.0 >= 5.0
1.0 1.0 <= -3.0
1.0 5.0 >= 5.0
maximize 1.0 2.0
-------------------------
Sample output:
INFEASIBLE




"redundant equations"
Sample input:
-----------------------------
4 5
3.0 2.0 1.0 0.0 0.0 == 1.0
5.0 1.0 1.0 1.0 0.0 == 3.0
2.0 5.0 1.0 0.0 1.0 == 4.0
4.0 4.0 1.0 1.0 1.0 == 6.0
minimize 1.0 1.0 1.0 1.0 1.0
-----------------------------
Sample output: 
4.500
0.000 0.500 0.000 2.500 1.500