Operations Research Asked by che on December 22, 2020
I want to write the following constraint:
Let $z$ be an integer variable such that $0le zle M$, and $t$ be a binary variable where $M$ denotes big-M. The logical constraint is as follows:
if $z leq M$ and $z > 0$ then $t=1$;
if $z=0$ then $t=0$.
Is this $z≤Mt$ sufficient? The $t$ and $z$ variables are not in my objective function but variable $t$ is connected to another variable in the objective function?
Thank you very much, I appreciate your help.
The big-M constraint $z le M t$ does enforce $z > 0 implies t = 1$, equivalently its contrapositive $t = 0 implies z = 0$, but not the converse $$z = 0 implies t = 0. tag1$$ To enforce $(1)$, consider its contrapositive $$t = 1 implies z > 0 tag2,$$ which you can enforce via big-M constraint $$epsilon - z le (epsilon - 0)(1 - t),$$ equivalently, $$z ge epsilon t,$$ where $epsilon > 0$ is a tolerance that represents the smallest value of $z$ that you would consider to be positive.
Correct answer by RobPratt on December 22, 2020
1 Asked on August 19, 2021
1 Asked on August 19, 2021
1 Asked on August 19, 2021 by antarctica
2 Asked on August 19, 2021 by qinqinxiaoguai
6 Asked on March 1, 2021 by rajya
integer programming linearization nonlinear programming quadratic programming
1 Asked on March 1, 2021 by windbreeze
1 Asked on February 18, 2021 by dspinfinity
0 Asked on February 18, 2021 by yue-chao
1 Asked on February 15, 2021 by user152503
1 Asked on January 18, 2021
linear programming linearization logical constraints mixed integer programming
0 Asked on January 18, 2021 by amedeo
0 Asked on January 15, 2021 by robert-hildebrand
integer programming optimization scheduling simulated annealing solver
3 Asked on January 11, 2021 by stevgates
1 Asked on January 8, 2021 by fathese
1 Asked on December 22, 2020 by che
binary variable linear programming linearization logical constraints mixed integer programming
1 Asked on December 13, 2020 by high-gpa
3 Asked on November 28, 2020 by joffrey-l
1 Asked on September 25, 2020 by independentvariable
convex optimization convexity nonconvex programming probability distributions
Get help from others!
Recent Answers
Recent Questions
© 2022 AnswerBun.com. All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP