big M constraints bringing an infeasinle solution
9 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
Paramvir Singh
il 5 Mag 2018
Commentato: Nicola Blasuttigh
il 17 Gen 2021
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/190335/image.png)
Here Tins is a decision variable of size=(24,1) in my optimization problem. The value of Tins(min_des) =20 while value of Tins(max_des) = 23.
I have tried using the following constraints for the above equation in MILP problem.
(Tmin - Tins) - M1*(1-BCac) <= 0 where M1 is an upper bound on (Tmin - Tins)
(Tins - Tmax) - M2*BCac <= 0 where M2 is an upper bound on (Tins - Tmax)
But if its supposed that Tins=27
then my first constraint gets satisfied with both BCac=1 and BCac=0
although the second constraint is satisfied at BCac=1 only, which is correct.
But due to the first constraint, my program is getting an infeasible solution.
Any help would be deeply appreciated.
5 Commenti
Mary Fenelon
il 9 Mag 2018
Paramvir is using the new syntax for specifying solve options introduced in 18a.
Paramvir, here a couple of suggestions to diagnose the infeasibility:
- Write a text version of the problem with writeproblem and make sure your constraints are as you expect
- Often, it's one group of constraints that lead to infeasibility. Try to identify that group by commenting out groups of constraints.
Risposta accettata
Più risposte (0)
Vedere anche
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!