Does intlinprog find a local minimum or global minimum?

Question

ryugasen 2021-11-8

2
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1581524-does-intlinprog-find-a-local-minimum-or-global-minimum

编辑： Matt J 2021-11-8

I have a problem that can mathematically be described as a MILP. However, it is essential that I find the global optimum (if it exists) and not just a feasible point. So I understand that the relevant matlab function is intlinprog. According to Matlab documentation (https://www.mathworks.com/help/optim/ug/local-vs-global-optima.html), I know that linprog guarantees global optimum and not just a local one. My question is does intlinprog guarantee the same or not?

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Matt J 2021-11-8

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1581524-does-intlinprog-find-a-local-minimum-or-global-minimum#answer_826414

编辑：Matt J 2021-11-8

在 MATLAB Online 中打开

In ideal math, yes, however real world computers can't do ideal math, so you can be significantly off from the global solution depending on how you set your tolerances.. This is illustrated in the example below. The ideal global minimum is y=1, but intlinprog finds y=0, because it is within the default numerical tolerances.

x=optimvar('x',1,'type','integer','LowerBound',0);
y=optimvar('y',1,'type','integer','LowerBound',0);
prob=optimproblem('Objective',y, 'Constraints', y>=x+1e-4);
sol=solve(prob)
Solving problem using intlinprog.
LP:                Optimal objective value is 1.000000.                                             


Optimal solution found.

Intlinprog stopped at the root node because the objective value is within a gap tolerance of the optimal value, options.RelativeGapTolerance = 0.0001 (the default value). The intcon variables are integer within tolerance,
options.IntegerTolerance = 1e-05 (the default value).
sol = struct with fields:
    x: 0
    y: 0

5 个评论
显示 3更早的评论隐藏 3更早的评论

Matt J 2021-11-8

编辑：Matt J 2021-11-8

在 MATLAB Online 中打开

Not that I know of. The global minimum itself is an uncertain thing that can vary discontinuously due to small uncertainties in the problem data. Consider the two solutions below. If the difference between b1 and b2 is meant to be significant, then the solver has correctly given us different solutions. However, if the difference between b1 and b2 is just the result of floating point calculation errors, and they are really supposed to be the same, then one of the solutions is wrong. We can't know which one, because we don't know which b is the correct one.

x=optimvar('x',1,'type','integer','LowerBound',0);
y=optimvar('y',1,'type','integer','LowerBound',0);
b1=1e-7;
b2=0;
prob1=optimproblem('Objective',y,'Constraints', y>=x+b1);
prob2=optimproblem('Objective',y, 'Constraints', y>=x+b2);
opts=optimoptions('intlinprog','ConstraintTolerance',1e-8,'IntegerTolerance',1e-6);
solve(prob1,'options',opts)
Solving problem using intlinprog.
LP:                Optimal objective value is 1.000000.                                             


Optimal solution found.

Intlinprog stopped at the root node because the objective value is within a gap tolerance of the optimal value, options.AbsoluteGapTolerance = 0 (the default value). The intcon variables are integer within tolerance,
options.IntegerTolerance = 1e-06 (the selected value).
ans = struct with fields:
    x: 0
    y: 1
solve(prob2,'options',opts)
Solving problem using intlinprog.
LP:                Optimal objective value is 0.000000.                                             


Optimal solution found.

Intlinprog stopped at the root node because the objective value is within a gap tolerance of the optimal value, options.AbsoluteGapTolerance = 0 (the default value). The intcon variables are integer within tolerance,
options.IntegerTolerance = 1e-06 (the selected value).
ans = struct with fields:
    x: 0
    y: 0

ryugasen 2021-11-8

编辑：ryugasen 2021-11-8

My alternative approach is a 'brute-force' method which is something along this line: I list all possible combinations of the integer variables (each one ranges from -2 to 2 or narrower). There are about 5-10 of these variables, so end up with somewhere between 5000 to 500,000 combinations. Then using a for loop, I evaluate the remainder of the constraints using linprog for each combination of the integer variables and store the optimum of each one. Then at the end, the global optimum would be the optimum of the optimums. Would this be more reliable than intlinprog for a problem of this scale?

Matt J 2021-11-8

编辑：Matt J 2021-11-8

在 MATLAB Online 中打开

I don't think so, because let's apply your proposal to my earlier example, adding an upper bound of 2 on both x and y.

x=optimvar('x',1,'type','integer','LowerBound',0,'UpperBound',2);
y=optimvar('y',1,'type','integer','LowerBound',0,'UpperBound',2);
prob=optimproblem('Objective',y, 'Constraints', y>=x+1e-8);

In this case, there are no non-integer variables, so your method reduces to simply evaluating all 9 combinations 0<=(x,y)<=2.

But how will you decide whether the combination (x,y)=(0,0) is supposed to be feasible or not, bearing in mind that the 1e-8 might just be floating point noise? The decision you make will change the solution and its optimum value by 1.

请先登录，再进行评论。

Answer 2

Chunru 2021-11-8

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1581524-does-intlinprog-find-a-local-minimum-or-global-minimum#answer_826424

MILP is NP-hard problem. All solvers require some heuristic rules and the global optimum can not guarenteed for larger problems.

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

Answer 3

John D'Errico 2021-11-8

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1581524-does-intlinprog-find-a-local-minimum-or-global-minimum#answer_826504

Another issue is that it is easy to formulate a problem with multiple solutions, all equally good. intlinprog should find one of them, but any solution is as good as another. These will typically lie along a constraint boundary, or parallel to one. So is that a global solution or a local one? It depends on how you choose to define what a local solution means to you.