Hi. I'm currently doing my project, which include optimization models for the computation of backup paths with MILP using CPLEX and i'm learning CPLEX now, what should i start with? to learn CPLEX very well
Hi , thanks a lot. This is a great help;. I'm currently doing my project, which include optimization models its VRP time window but while running, my decision variable that i wish minimize, took the maximum bound that i fixed. Could you help me pleasssse
CPLEX Error 1016: Promotional version. Problem size limits exceeded. if try for choose 100 as number of input it works unless to choose below 30 as input number Found incumbent of value 59755.308583 after 0.00 sec. (0.06 ticks) Tried aggregator 1 time. Reduced MIP has 872 rows, 899 columns, and 4176 nonzeros. Reduced MIP has 870 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 0.02 sec. (2.17 ticks) Probing time = 0.01 sec. (2.54 ticks) Tried aggregator 1 time. Reduced MIP has 872 rows, 899 columns, and 4176 nonzeros. Reduced MIP has 870 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 0.00 sec. (2.18 ticks) Probing time = 0.02 sec. (2.54 ticks) Clique table members: 60. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.02 sec. (1.06 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 59755.3086 0.0000 100.00% * 0 0 integral 0 1220.4041 1220.4041 49 0.00% Elapsed time = 0.06 sec. (13.30 ticks, tree = 0.00 MB, solutions = 2) Root node processing (before b&c): Real time = 0.06 sec. (13.34 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 0.06 sec. (13.34 ticks) Process finished with exit code 0
cplex with java viedo is excellent. Please share more video espatialy on MILP(Mixed Linear programing).
Thanks a lot. This is a great help! Could you please post the tuning part of this TSP programming?
Hi. I'm currently doing my project, which include optimization models for the computation of backup paths with MILP using CPLEX and i'm learning CPLEX now, what should i start with? to learn CPLEX very well
sorry i have a question, i play code but console result 'Infeasibility row 'c1': 0 = 1.'
thank you for the video, it is very informative!
What if I have a couple of nodes so that I don't need a graph from destination i to destination j but from flight i [X to y] to flight j [y to Z] ?
Thank you for your great videos. very helpful.
Hi , thank you for your courses, can you please provide the link to the .java file of the Salesman pb, that would be more practical.
Regards.
I wonder how Cplex can know that u[i] represents the order visited by node i, or at least a constraint of type like if(x[i][j] == 1): u[ i]
Hi, thanks a lot for your courses! Could you please share a video how to solve NLP (Non Linear Programming) problem using CPLEX?
where is the part5 ?
Hi , thanks a lot. This is a great help;. I'm currently doing my project, which include optimization models its VRP time window but while running, my decision variable that i wish minimize, took the maximum bound that i fixed. Could you help me pleasssse
CPLEX Error 1016: Promotional version. Problem size limits exceeded. if try for choose 100 as number of input it works unless to choose below 30 as input number Found incumbent of value 59755.308583 after 0.00 sec. (0.06 ticks)
Tried aggregator 1 time.
Reduced MIP has 872 rows, 899 columns, and 4176 nonzeros.
Reduced MIP has 870 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (2.17 ticks)
Probing time = 0.01 sec. (2.54 ticks)
Tried aggregator 1 time.
Reduced MIP has 872 rows, 899 columns, and 4176 nonzeros.
Reduced MIP has 870 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (2.18 ticks)
Probing time = 0.02 sec. (2.54 ticks)
Clique table members: 60.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 4 threads.
Root relaxation solution time = 0.02 sec. (1.06 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0+ 0 59755.3086 0.0000 100.00%
* 0 0 integral 0 1220.4041 1220.4041 49 0.00%
Elapsed time = 0.06 sec. (13.30 ticks, tree = 0.00 MB, solutions = 2)
Root node processing (before b&c):
Real time = 0.06 sec. (13.34 ticks)
Parallel b&c, 4 threads:
Real time = 0.00 sec. (0.00 ticks)
Sync time (average) = 0.00 sec.
Wait time (average) = 0.00 sec.
------------
Total (root+branch&cut) = 0.06 sec. (13.34 ticks)
Process finished with exit code 0
Thank you very much, it was very helpful