$($b$)$

Formulate the problem as a linear program. $($Express your answers in the form xij where xij is $1$ if leader i is assigned to client j and $0$ otherwise.$)$

Min

s$.$t$.$Jackson

Ellis

Smith

Client $1$

Client $2$

Client $3$

xij $0$ for all i$,$ j$.$

Solve.

Relationship Value Time $($days$)$ x$11$x$12$x$13$x$21$x$22$x$23$x$31$x$32$x$33$

$($c$)$

What is the total time required $($in days$)?$

days

$($i$)$

revised schedule

$($x$11,$ x$12,,$ x$33,$ x$34)=$