# Logical constraint in ILP

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

## Related Questions

### Conditions required for strong duality to hold for SDPs

1  Asked on August 19, 2021

### Relationship between extreme points and optimal solutions of SDPs

1  Asked on August 19, 2021

### How to parallelize metaheuristics algorithms (Island Model)?

1  Asked on August 19, 2021 by antarctica

### Can we get closed form solution for such a problem?

1  Asked on August 19, 2021

### Can we use reinforcement learning and convex optimization to solve an optimization problem?

2  Asked on August 19, 2021 by qinqinxiaoguai

### Nonlinear integer (0/1) programming solver

6  Asked on March 1, 2021 by rajya

### How can I find the shortest path for all nodes in a graph from a source $s$?

1  Asked on March 1, 2021 by windbreeze

### Free solver for MINP problems

1  Asked on February 18, 2021 by dspinfinity

### Where I can study some job shop scheduling by course (video )?

0  Asked on February 18, 2021 by yue-chao

### Linear objective function with power term in constraint

1  Asked on February 15, 2021 by user152503

### Formulating these logical constraint in an ILP

1  Asked on January 18, 2021

### Modeling the multiplication of two binary decision variables in undirected graph in python

0  Asked on January 18, 2021 by amedeo

### Flexible Job Shop with Preemption

0  Asked on January 15, 2021 by robert-hildebrand

### How to handle an equality constraint in metaheuristic algorithms (like GA, PSO)?

3  Asked on January 11, 2021 by stevgates

### What is the difference between min- cut formulation and (bi) partitioning formulation?

1  Asked on January 8, 2021 by fathese

### Logical constraint in ILP

1  Asked on December 22, 2020 by che

### Quasi-convex function must be “partially monotonic”?

1  Asked on December 13, 2020 by high-gpa

### Constraint programming resources

3  Asked on November 28, 2020 by joffrey-l

### Pyomo variable creation dilemma

1  Asked on October 31, 2020 by ethan-deakins

### Convexity of the variance of a mixture distribution

1  Asked on September 25, 2020 by independentvariable