Binary LP Problem

[MeraSJ]

Hi there!

I'm looking for an answer with one binary LP problem.
I have 5 police cars and 3 emergency calls and the distances each car travels towards each call. I know that I have to minimize the distance and make the constrains such as sums of all the car distances must be less or equal to 1 and sums of all call must be more or equal to 1, and the binary constrain for each variable.. but excel refused give an answer..
Someone has an idea how can I solve my problem?
distances are:
call 1 call 2 call 3
car 1 10 11 18
car 2 6 7 7
car 3 7 8 5
car 4 5 6 4
car 5 9 4 7
thank you in advance for your comments...

 

[Mark W.]

I trust that you only wanted to dispatch 3 cars. The model's constraints are saved in column G...

Book1
	A	B	C	D	E	F	G	H	I	J	K	L	M
1		call1	call2	call3			14
2	car1	10	11	18			15
3	car2	6	7	7			TRUE
4	car3	7	8	5			TRUE
5	car4	5	6	4			TRUE
6	car5	9	4	7			100
7
8		call1	call2	call3
9	car1	0	0	0	0
10	car2	0	0	0	0
11	car3	0	0	1	1
12	car4	1	0	0	1
13	car5	0	1	0	1
14		1	1	1
15
16		14
17
Sheet5