Regarding optimization and mass calculation

Hello, I would like to solve a problem with Matlab.

I simplified the question.

First of all, A and B are the departing locations while 1, 2, and 3 are the possible destinations. There are 30 same products in total, 10 are in A, and 20 are in B respectively. The three destinations of 1, 2, 3 can receive 11 products max. The 30 products should be delivered to one of the three destinations. The delivery cost per product is as follows:

A (Departure) -> 1 (Arrival): $9 per product (Delivery Cost), A->2: $8, A->3: $8, B->1: $10, B->2: $7, B->3: $9.

I would like to minimize the total delivery cost by calculating all possible combinations of deliveries. For example, from A to 1, 2, 3, (1, 1, 8) products, (1, 2, 7), (1, 3, 6),...,(8, 1, 1) can be the possible options. I need a code that can be used for more complicating problems where more departure and arrival options are available.

Please help me code this. Is there any function I can use?

[Eng. Fredius Magige]

Hi Possible there are code on that. It seem destination distance might be there/quantified (main factor). Search in MATLAB, you can get the an appropriate code. Plaese introduce your thought complicated question to us/community Thanks

Answer 1

[Alan Weiss]

Your question seems related to the Factory example.

Alan Weiss

MATLAB mathematical toolbox documentation

[SANG GYU LEE]

That problem is a bit different, but some functions used in the example are very useful. Thanks