can you solve this example method?

Cargo company A has a depot that serves 8 demand points existing in the city center. Since vehicles are not allowed to enter city center, the company uses cross docking eption. There exist 4 parking lots which can be used as cross docking points at the outskirts of the city. Large vehicles (10 tonne per vehicle) are used for the delivery between the depot and the cross docking points. Small vehicles ( 5 tone) are used for distribution in the city center. The given figure illustrates the SC structure. Note that we have only direct flows among the nodes, milk runs are not allowed. A large vehicle consumes 2 liters per km and small one consumes 0.5 liter per km. Symmetric distances (in kms ) and demand (in tonnes) are as follows. All vehicles turn back to their initial locations (the depot or the corresponding cross docking point where the delivery starts) after service completion. At most 2CDs have to be ased doe to lessen complexity of logistics operations. A customer might be served from more than one CD. Formulate a MiL.P model to minimize total fuel consumed in delivery operations. We need to minimize fuel using integer liner programming. We will apply the minimization method of operation research. how can we make the deliveries in the story with the least amount of fuel. Se Set of cross doching points cij= customer i provided from cross deching point j c= set of customers dc= demand of customers yx= should cross docking point be used or not {1,0} min200s1yx+160s2yx+180s3yx+140s4yx+5c1,1+3c1,2+0.5c1,3+2.5c1,4+4.5c2,1+2.5c2,2+1c2,3+2c2,4+4c3,1+2c3,2+1.5c3,3+4.5c3,4+3c4,1+4c4,2+2c4,3+4c4,4+4c5,1+25c5,2+2.5c5,3+4.5c5,4+5c6,1+3.5c6,2+6c6,3+5c6,4+4c7,1+3c7,+7c7,3+22c7,4+4c8,1+1c8,2+75c8,3+5c8,4 constraints dc1=8dc3=3dc5=5dc7=1dc2=4dc4=6dc6=2dc8=9s1+S2+S3+S42 Cargo company A has a depot that serves 8 demand points existing in the city center. Since vehicles are not allowed to enter city center, the company uses cross docking eption. There exist 4 parking lots which can be used as cross docking points at the outskirts of the city. Large vehicles (10 tonne per vehicle) are used for the delivery between the depot and the cross docking points. Small vehicles ( 5 tone) are used for distribution in the city center. The given figure illustrates the SC structure. Note that we have only direct flows among the nodes, milk runs are not allowed. A large vehicle consumes 2 liters per km and small one consumes 0.5 liter per km. Symmetric distances (in kms ) and demand (in tonnes) are as follows. All vehicles turn back to their initial locations (the depot or the corresponding cross docking point where the delivery starts) after service completion. At most 2CDs have to be ased doe to lessen complexity of logistics operations. A customer might be served from more than one CD. Formulate a MiL.P model to minimize total fuel consumed in delivery operations. We need to minimize fuel using integer liner programming. We will apply the minimization method of operation research. how can we make the deliveries in the story with the least amount of fuel. Se Set of cross doching points cij= customer i provided from cross deching point j c= set of customers dc= demand of customers yx= should cross docking point be used or not {1,0} min200s1yx+160s2yx+180s3yx+140s4yx+5c1,1+3c1,2+0.5c1,3+2.5c1,4+4.5c2,1+2.5c2,2+1c2,3+2c2,4+4c3,1+2c3,2+1.5c3,3+4.5c3,4+3c4,1+4c4,2+2c4,3+4c4,4+4c5,1+25c5,2+2.5c5,3+4.5c5,4+5c6,1+3.5c6,2+6c6,3+5c6,4+4c7,1+3c7,+7c7,3+22c7,4+4c8,1+1c8,2+75c8,3+5c8,4 constraints dc1=8dc3=3dc5=5dc7=1dc2=4dc4=6dc6=2dc8=9s1+S2+S3+S42