Linear Programming, Linear Algebra, Optimization, Simplex, Python.
last constrain (10c + 15t ≤ 450), represented by the green line. Following the same approach as before, we got the points on the axes as following: 45,0 and 0,30. In this plot, what we see is the superimposition of these two inequalities. By overlapping them, we can figure out the required solution