Algorithms, Optimization, Python, Linear Programming, Operations Research.
larger than 12. An even better upper bound if we first divide the first inequality by two. 2x₁ + 3x₂ ≤ 2x₁ + 4x₂ ≤ 6 An even better upper bound result if we add the first two inequalities together and divide by three, which leads to the inequality below, and hence the objective function cannot be