The U$.$S$.$ Air Force has enlisted your assistance in transporting a key airframe within the

continental United States. There are $9$ locations across the country that are in need of one of these

airframes each. There are $9$ other locations across the country that currently have a surplus of these

airframes. The Air Force would like to know how to move one airframe to each of the $9$ locations in need,

such that the total travel distance is minimized across all the combined moves. In doing so$,$ it wants each

of the locations with a surplus to lose only one airframe each, so as to not create possible shortages in

those locations.

Attached to this assignment is a spreadsheet containing the distance between each of the $9$ cities that

have a surplus of the airframe, and the $9$ other cities that are in need of one of the airframes.

Using linear, integer, or mixed integer programming, determine the $9$ routes that should be used in

making the moves of the airframe. In other words, to which location should Atlanta send an airframe, to

which location should Baltimore send an airframe, etc.? Also indicate the total collective miles that

would need to be travelled by your solution.Travel Distance in Miles

Additional details: I need to build a linear integer program using Lingo. Building the program on Excel can be too clunky.