Essay
A certain military deployment requires supplies delivered to four locations.These deliveries come from one of three ports.Logistics planners wish to deliver the supplies in an efficient manner,in this case by minimizing total ton-miles.The port-destination data,along with destination demand is provided in the following table.
The ports are supplied by one of two supply ships.These ships travel to a particular port where their supplies are off-loaded and shipped to the requesting destinations.Ship S1 carries 1200 tones of supplies while Ship S2 carries 1120 tons of supplies.These ships can only go to a single port and each port can only accommodate one ship.
Assume the costs for a ship to travel to a port are not part of the objective function.
Formulate the ILP for this problem capturing the ship choice of ports and the supply-to-demand transportation from the ports to the destinations.
Correct Answer:

Verified
Correct Answer:
Verified
Q18: The branch-and-bound algorithm starts by<br>A) relaxing all
Q20: Rounding the LP relaxation solution up or
Q28: A company wants to build a new
Q28: How is an LP problem changed into
Q32: The branch & bound algorithm stops when:<br>A)
Q34: A small town wants to build
Q59: Exhibit 6.1<br>The following questions pertain to the
Q64: Mixed IP formulation requires that:<br>A) all decision
Q77: Any integer variable in an ILP that
Q88: Consider the constraint <br>X<sub>3</sub> + X<sub>4</sub> +