The ILP problem is given by matrix 𝐀 ∈ ℝᵐ×ⁿ and vectors 𝐛 ∈ ℝᵐ and 𝐜 ∈ ℝⁿ. The goal is to find a vector 𝐱 ∈ ℤⁿ such that 𝐀 · x ≤ b and cᵀ · x is the maximum. Usually, the problem is given as max {cᵀ · x : 𝐀 · x ≤ b, x ∈ ℤⁿ}. “A large number of practical optimization problems can be modeled and solved using Integer Linear Programming - ILP.” Comments