Skip to main content

Questions tagged [logical-constraints]

For questions about constraints that can be expressed in (usually propositional) logic.

Filter by
Sorted by
Tagged with
5 votes
1 answer
188 views

On a square grid, a loop passes through each cell exactly once. For certain rows and columns, the maximum number of consecutive cells traversed by the path in that row or column is bounded by the tag ...
NormalFit's user avatar
  • 486
0 votes
0 answers
44 views

I am analyzing a specific instance of the Single-item Economic Lot-Sizing (ELS) problem where production costs are piecewise linear and backlogging is allowed. I have a "target" solution ...
Ptr's user avatar
  • 1
4 votes
3 answers
167 views

I'm an engineer who is working on an unrelated parallel machine scheduling problem to minimize total completion time, but with an additional practical constraint: each machine has a maximum sequence ...
Tuong Nguyen Minh's user avatar
0 votes
2 answers
155 views

In a worker shift assignment problem, let's suppose there are some unassigned shifts for a day (e.g., morning 8 to 11 is an unassigned shift that any qualified worker can take) and some additional ...
ORProfessional's user avatar
1 vote
1 answer
95 views

I'm trying to model the scheduling of operations over a set of production assets considering uncertainty, individual costs and time dependent fixed operation costs ($c_f(t)$). Without exposing all the ...
motmot2910's user avatar
2 votes
0 answers
63 views

I would like to formulate the graph crossing minimization problem as a MI(N)LP (it's ok if it is non linear) : given a graph $G(V,E)$, what is the minimum number of edge crossings in any drawing of $G$...
NormalFit's user avatar
  • 486
0 votes
0 answers
64 views

I have two type of nodes: $S$ for multiple visits and $C$ for a single visit. I'm trying to avoid the case of subtour. With the formula $(A)$, I could handle some cases but still can not avoid the ...
MAYA's user avatar
  • 203
0 votes
1 answer
95 views

I’m trying to formulate the following statement: If $x_{ij}=1$ and $x_{ji}=0$ then $y=1$ else 0 in other three cases, where $x_{ij}$ is binary variable. So, $$y \leq x_{ij} + M(1-x_{ij})$$ $$x_{ij} - ...
MAYA's user avatar
  • 203
0 votes
2 answers
105 views

I try to formulate constraints to check isolated nodes. For a node $i$ where $x_{ij}$ is a binary variable is equal to $1$ if it exists an arc $(i,j)$ for $i$ to $j$: if $\sum_{j \in N} x_{ij} = 0$ ...
MAYA's user avatar
  • 203
0 votes
1 answer
85 views

For a node $s$, I want to count how many nodes with loop when there exists at least one outgoing arc without incoming arc. So, if $x_{is}=1$ and $x_{si}=0$ then $z_s=1$. So basically, if $z_s=0$ means ...
MAYA's user avatar
  • 203
0 votes
1 answer
72 views

For a node $s$, I can have loop or outgoing arc. How to check that there is at least an outgoing arc from $s$ without incoming: If $x_{is}=1$ and $x_{si}=0$ then $z=1$
MAYA's user avatar
  • 203
2 votes
0 answers
109 views

I understand that the standard answer to this is to model $x = 0 \implies y - \varepsilon \geq b$. To avoid numerical issues (I'm using this for computing reduced costs), I would like to have a ...
João Dionísio's user avatar
0 votes
1 answer
85 views

I can't find a constraint that formulate both cases, $x$ and $y$ are binary variables: if $\sum x_{ij} = 0$ then $y_j=0$ if $\sum x_{ij} \geq 1$ then $y_j=1$ I try this constraint: $\sum x_{ij} \leq M*...
MAYA's user avatar
  • 203
2 votes
0 answers
96 views

Background I am a network engineer working on optimization problems focused on minimizing completion time for computational tasks. My initial model, as described in a previous question, targeted Monte ...
Tuong Nguyen Minh's user avatar
0 votes
1 answer
164 views

Is it possible in MILP to sum only binary variable that not equal to $1$ based on condition if else: If $x_1=1$ and other variables equals to one (already visited) than sum only variables that not ...
MAYA's user avatar
  • 203

15 30 50 per page
1
2 3 4 5
13