I am attempting Q17 on this worksheet: http://www.statslab.cam.ac.uk/~qb204/teaching/ex_optim_2.pdf
Am i correct in reformulating the problem as : minimise $\sum_{i=1}^{n} \sum_{j=1}^{n} tij $ ? But I don't understand what constraints there need to be. Also in b) it gives me a matrix but to use the transportation algorithm I beloieve I need to be given supplies and demands?
Thank you in advance.
$x_{ij}=\begin{cases} \text{1 , if taxi i pick up costumer j} \ \text{0, if taxi i doesn´t pick up costumer j}\end{cases}$ The values of $t_{ij}$ are fixed. That are the values of the matrix. Is that comprehensible ?
– callculus42 Aug 16 '18 at 14:38