The running time of binary integer linear programming and linear programming
7 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Salwa Mostafa
le 14 Sep 2021
Modifié(e) : Salwa Mostafa
le 14 Sep 2021
Hi
I have a binary integer linear programming problem and I relax the binary integer constraint. I use the two built in functions intlinprog and linprog in matlab to solve the problem. I expexct that the running time of binary integer to be larger than the linear programming but when I do the simulation it is the opposit and I dont know what is wrong. Any suggestions.
0 commentaires
Réponse acceptée
John D'Errico
le 14 Sep 2021
Why is there something "wrong"? It is unexpected for you. But this just comes down to two different problems, solved by different algorithms. Depending on the size of the problem, and any specifics, one algorithm may have an easier solution, and thus take less time. In fact, we don't even know if you used good methods to determine the time for each solve. For example, toc and toc are generally a bad way to compute the time required for code. And we certainly do not know what size problem is this, how many variables, how many constraints, are there equality or inequality constraints or both, etc.
1 commentaire
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur Linear Programming and Mixed-Integer Linear Programming dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!