1. Consider a variant of the cargo flight loading problem with two types of cargo, reserved and on-spot. Reserved cargo, with quantity denoted by aji, has to be transported from city i to city j. On-spot cargo, with the maximum quantity denoted by b, is optional with a unit profit of lii. The problem is to maximum the profit of the flight, by determining the quantity Xji of each on-spot cargo to load. For your reference, below is the network flow model for the original one-type cargo flight loading problem, where p is the capacity of the flight. + Modify this network flow model to solve the above two-type cargo problem. [Hint and Bonus: An easy model is to introduce more nodes. However, if your model does not need to introduce more nodes, you will get extra 20% credit for this assignment.] b24 14 \634 1-4 2-4 3-4 -124 123 1-3 1-113 2-3 -r14 \012 -1 34 - 1-2 2 bi2 b13 +b23 b 14 +624 + 34 1. Consider a variant of the cargo flight loading problem with two types of cargo, reserved and on-spot. Reserved cargo, with quantity denoted by aji, has to be transported from city i to city j. On-spot cargo, with the maximum quantity denoted by b, is optional with a unit profit of lii. The problem is to maximum the profit of the flight, by determining the quantity Xji of each on-spot cargo to load. For your reference, below is the network flow model for the original one-type cargo flight loading problem, where p is the capacity of the flight. + Modify this network flow model to solve the above two-type cargo problem. [Hint and Bonus: An easy model is to introduce more nodes. However, if your model does not need to introduce more nodes, you will get extra 20% credit for this assignment.] b24 14 \634 1-4 2-4 3-4 -124 123 1-3 1-113 2-3 -r14 \012 -1 34 - 1-2 2 bi2 b13 +b23 b 14 +624 + 34