Exercise $1$: Construct a mathematical model of an integer programming pro$-$

blem and use Solver to nd the optimal solution $($don$\text{'}$t forget to add integer

constraints in the Constraints$)$:

c$)$ Transportation Problem

A transportation company in city $S$ supplies palletized goods to $4$ neighboring

cities A$,$ B$,$ C$,$ and D$,$ equidistant from S$.$ Today it has to deliver $110$ pallets

to city A$,70$ to B$,58$ to C$,$ and $62$ to D$.$ It has two types of trucks with fixed

travel prices: $6$ small trucks with a capacity of $33$ pallets and a travel price of

$120$ CZK$,$ and $4$ large trucks with a capacity of $60$ pallets and a travel price of

$190$ CZK$.$ Each truck can only make one trip per day. Which trucks should go

where to minimize the transportation cost?