Algorithms, Optimization, Python, Linear Programming, Operations Research.
larger than 5. Basically, from the constraints, we are trying to derive an inequality of the form: d₁x₁ + d₂x₂ ≤ h where d₁ ≥ 2, d₂ ≥ 3, h as small as possible. Then we can claim that: for all x₁, x₂ ≥ 0 we have 2x₁ + 3x₂ ≤ d₁x₁ + d₂x₂ ≤ h Therefore, h is an upper bound on the maximum of the