List questions from mixed-integer-programming

Published on 22 Mar 2026 - 7:51

455

Views

MILP: Minimizing $|Ax-b|$ with at most 5 x variables being non-zero

Published on 22 Mar 2026 - 1:28

276

Views

How to prove that 1/3 is the optimal solution for the muffin problem with 5 students and 7 muffins?

Published on 21 Mar 2026 - 17:04

103

Views

Rewrite the constraint $ p(x)=0 \Rightarrow q(x)=0 $ in an optimization problem

Published on 09 Nov 2018 - 15:04

67

Views

Rewrite $[p_1(x)\geq 0 \text{ and } p_2(x)\geq 0] \Rightarrow q(x)\geq 0$, $[-p_1(x)\geq 0 \text{ and } -p_2(x)\geq 0] \Rightarrow q(x)\geq 0$

Published on 10 Nov 2018 - 14:31

42

Views

How do you set up this constraint in integer programming using binary variables?

Published on 13 Nov 2018 - 1:33

247

Views

MIQP problem slow to solve: how to rewrite it?

Published on 15 Nov 2018 - 23:02

46

Views

which combination(partiotioning ) has the smallest value?

Published on 01 Dec 2018 - 3:43

122

Views

Do redundant constraints help in big-M reformulation?

Published on 03 Dec 2018 - 12:31

240

Views

Question to the solution of "Indicator Variable if x is in specific range"

Published on 06 Dec 2018 - 23:00

184

Views

SOS1 for linearizing complementarity condition

Published on 11 Dec 2018 - 2:28

39

Views

integer programming linearization

Published on 12 Dec 2018 - 5:39

542

Views

Count the number of unique elements in a vector by linear constraints (ILP)

Published on 17 Dec 2018 - 17:19

167

Views

Resource Allocation Problem

Published on 19 Dec 2018 - 7:08

27

Views

Enforce constraints in nth visited node

Published on 19 Dec 2018 - 12:22

List Question

Forcing a series of OR statements in ILP Problem

MILP: Minimizing $|Ax-b|$ with at most 5 x variables being non-zero

How to prove that 1/3 is the optimal solution for the muffin problem with 5 students and 7 muffins?

Rewrite the constraint $ p(x)=0 \Rightarrow q(x)=0 $ in an optimization problem

Rewrite $[p_1(x)\geq 0 \text{ and } p_2(x)\geq 0] \Rightarrow q(x)\geq 0$, $[-p_1(x)\geq 0 \text{ and } -p_2(x)\geq 0] \Rightarrow q(x)\geq 0$

How do you set up this constraint in integer programming using binary variables?

MIQP problem slow to solve: how to rewrite it?

which combination(partiotioning ) has the smallest value?

Do redundant constraints help in big-M reformulation?

Question to the solution of "Indicator Variable if x is in specific range"

SOS1 for linearizing complementarity condition

integer programming linearization

Count the number of unique elements in a vector by linear constraints (ILP)

Resource Allocation Problem

Enforce constraints in nth visited node

Trending Questions

Popular # Hahtags

Popular Questions