intlinprog could not find a feasible solution
Mostra commenti meno recenti
Hi everyone, I am now trying to use Intlinprog to solve a minimization problem. It could not find a feasible solution. I have tried to change 'CutMaxIterations' to 25, 'CutGeneration' to 'advanced. It still could not find the solution. What should I do?
6 Commenti
John D'Errico
il 14 Ago 2017
Why do you presume that a feasible solution exists, despite evidence to the contrary? If none was found, then the odds are pretty good that no such thing exists.
YU LI
il 15 Ago 2017
Torsten
il 15 Ago 2017
Does the problem remain infeasible if you remove the integer constraints ?
Best wishes
Torsten.
John D'Errico
il 15 Ago 2017
Modificato: John D'Errico
il 15 Ago 2017
So you changed a parameter, and no solution can now be found. This does not prove a solution exists. Again, there is good evidence that no solution exists, and only your assurance that the code is perfect.
The feasible subspace is the locus of points in the search space that satisfy your inequalities, as well as any equalities, and of course any bound constraints. That set may now be small enough that no locations with integer values now exist. Or this set may be completely empty.
As Torsten has suggested, if you relax the integer requirement, then you can see if the search space is indeed completely empty or not.
YU LI
il 15 Ago 2017
YU LI
il 15 Ago 2017
Risposte (0)
Categorie
Scopri di più su Univariate Discrete Distributions in Centro assistenza e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!