# Linked Questions

0answers
304 views

3answers
6k views

1answer
3k views

### Expressing conditional in linear program [duplicate]

I have two variables $A$ and $B$, with $A$ being binary and $B$ is a real number where $B \ge 0$. My conditions are: if B > 0 A = 1 else A = 0 ...
1answer
1k views

### Converting If-else condition to Linear Programming

I have a constraint in a linear programming formulation with two variables: $X \ge Y$ To which I want to apply the following if-else conditions: ...
1answer
3k views

I have liner programme with set of $x_{3n}$ variables where $x_{ij}$ are {0,1}. I am solving this linear programme using LP-Solve. Using these variables, I want to form following constraint : $max(... 2answers 520 views ### How to reduce the low-rank matrix completion problem to integer programming? Consider the low-rank matrix completion problem: Given an integer$k$and a subset of entries of some$n \times n$matrix, fill in the rest of the entries so that the resulting matrix has rank at ... 1answer 2k views ### Express a “complex” IF-Statement to Linear Programming In our current project we need to model the following if-statement in linear programming: If T1 < b < T2 then z = s else z = 0 where T1 and T2 are two ... 2answers 284 views ### Find a binary matrix so that no vector from {-1,0,1}^n is in its kernel Given integers$n,m$, I want to find a$m \times n$binary matrix$X$such that there does not exist any non-zero vector$y \in \{-1,0,1\}^n$with$Xy=0$(all operations performed over$\mathbb{Z}$). ... 1answer 1k views ### Express XOR with multiple inputs in zero-one integer linear programming (ILP) In the below post, it is explained how to express xor of two variables as linear inequalities. Express boolean logic operations in zero-one integer linear programming (ILP) Naturally, the xor of ... 2answers 751 views ### Schedule tasks from a weighted list with time frame constraints I'm attempting to create an automatic scheduler from a list of tasks I have available. Here are the key points: Each task has been given a priority beforehand and the algorithm should try to maximize ... 1answer 1k views ### How to solve an ILP problem with conditions in an objective function? I have came accross this link. I have an integer linear programming (ILP) problem $$\max_{(x_1, x_2,\ldots, x_n)}\sum_{i=1}^n x_i\cdot f(x_i),$$$\$\text{subject to } \begin{cases} ..., &(1)\\ L≤...

15 30 50 per page