An electrical contractor pays his subcontractors a

fixed fee plus mileage for work performed. On a given

day the contractor is faced with three electrical jobs

associated with various projects. Given below are the

distances between the subcontractors and the projects.

Projects

Subcontractor A B C

Westside $503616$

Federated $283018$

Goliath $353220$

Universal $252514$

How should the contractors be assigned so that total

mileage is minimized?

Provide a network representation for the assignment

problem $($with supplies$/$demand and $$costs$$ or distances

shown$)$

Formulate it as LP model