Originally posted by: SystemAdmin
Hello,
You can do something like this:
Minimize
Obj: c1 + c2 + c3
Subject To
R1: -2c1 + c2 + c3 = 1
R2: c1 - c2 = 0
R3: c1 - c3 = -1
R4: -2c2 + 2c3 = 2
General
c1 c2 c3
End
The solution to this is 0, 0, 1.
You could either use C callable library or C++/Java Concert or some other means that you are comfortable with, to load your matrix into CPLEX data structures. Once you do that, then you can use any of the CPLEX optimizers to solve the problem. In case of many solutions to your problem, the above would find the minimum of the sum. You could try other functions too.
Regards,
Vivek.
#CPLEXOptimizers#DecisionOptimization