A delivery problem:-
The local distributor of Blahs Beer has set up a warehouse in nn industrial park on the south side of Sudsville. The distributor is interested in increasing the effectiveness of the delivery process and has had the office staff identify all the demand points for Blahs. all the bars. restaurants. and liquor stores that are willing to distribute a product of such dubious quality.
In addition, the staff has been instructed to create on paper many feasible routes for the delivery trucks. Each route begins and ends at the warehouse and will fit a four-hour period. That is~ the trucker can load, drive, and distribute the entire contents of the truck and return to the warehouse in the time between check-in and lunch or between the end of lunch and quitting time.
Each route involves a truck whose total volume of delivery does not exceed its carrying capacity. Also. when the delivery truck stops at one of the drop-off points, it fills the entire demand at that drop-off point. Each delivery route is assumed to have approximately the same cost as any other. The distributor calls the local university to see if he can get a systems engineering class to select the least number of delivery routes that will serve all the firm ·s customers. This is your task-structure the appropriate 0, 1 program for the distributors problem.
Suppose the optimal solution produced by the method you suggested included two routes which both had delivery to the same point. How would you tell the distributor to treat this result?