zskurultay

zskurultay / JOptimizer / 0.1.0

README.md
This is a quick demo of 2D Linear Programming example found on http://www.joptimizer.com/linearProgramming.html

The algorithm takes in the following parameters, with regard to the notation on the website linked above, where the problem definition:

minimizex cTx+d  s.t. 
    Gx ≤ h 
    Ax = b,  

where G ∈ RmXn and A ∈ RpXn

is turned into:

minimizex cTx+d  s.t. 
    Ax = b,   
    lb ≤ x ≤ ub

So the parameters are:

[double[] c, double[][] G, double[] h, double[] lb, double[] ub]


Try passing in:

[[-1.0, -1.0], 
[[1.33, -1],[-0.5, 1.0], [-2.0, -1.0],[0.33, 1.0]],
[2.0, 0.5, 2.0, 0.5],
[0, 0],
[10, 10]]