挑战智力极限 国外某大学脑残又变态的路程问题 需要matlab

[weisen19]

1。两地相距100km
2。每走一个公里 要补充一块巧克力
3。A最多只能带100块巧克力每次
4。A可以往返多次在这100公里的路程上（目的：在路上扔下巧克力 之后剩下的确保返程就可以）
5。A到达100km远的地方 有人会补充40块巧克力给他（但是只能补充一次）
6。用matlab或者excel设计放案 得到最小直（就是A往返多少次 每次带多少巧克力 可以顺利的完成往返 是最小值）

我手算的是330 但是不知道怎么用matlab 懂行的大家来八下


英文原文如下
Chocolate bars and deserts/desserts
A cyclist is standing beside a bicycle with wide tyres suitable for travel over flat sand, in the middle of Lake Eyre (dry at the time). Beside the cyclist is a very large pile indeed of chocolate bars. The cyclist can carry at most 100 chocolate bars on the bike and needs one chocolate bar in order to travel 1km (the cyclist eats a chocolate bar for every km travelled). The cyclist wants to visit a friend, 100km away, and then to return to the starting place. The friend has 40 chocolate bars and will give them to the cyclist when the cyclist arrives. The question you have to investigate is “What is the minimum number of chocolate bars required by the cyclist in the pile at the start to complete this mission?”
Develop a strategy of your own to approach this problem and programme it in Excel or, better, Matlab. Demonstrate that the task can be achieved with the number of starting chocolate bars that you specify.

[weisen19]

可不可以用穷举法

[yangwenli]

最优化问题？

[weisen19]

我得的是280 第一次20km处扔60 第二次40km60 (用了第一次扔的）
第三次80bar带着 然后 ok了