HAVV, Variant No. 10, Mathematical Programming
Mission No. 1
Connect the task of linear programming in a graphic way and using the simplex method:
L = 3x1 + 3x2 → max
Mission No. 2
Avoid the transport task.
Oil processing plants with maximum daily productivity. Bensin is provided by the…