关于运筹学 动态规划的问题

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

请帮忙求解
MacBurger has just opened a fast-food restaurant in Bloomington.Currently,i0 customers frequent MacBurger(we call these loyal customers),and N-i0 customers frequent other fast-food establishments(we call these nonloyal customers).At the beginning of each month,MacBurger must decide how much money to spend on advertising.At the end of a month in which MacBurger spends d dollars on advertising.a fraction p(d) of the loyal customers become nonloyal customers,and a fraction q(d) of the nonloyal customers become loyal customers.During the next 12 months,MacBurger wants to spend D dollars on advertising.Develop a dynamic programming recursion that will enable MacBurger to maximize the number of loyal customers the company will have at the end of month 12.(Ignore the possibility of a fractional number of loyal customers)

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：动态规划 运筹学 Advertising Programming Possibility 运筹学 动态规划

我已经上传过动态规划的软件了，你在人大论坛上搜下！

2# lwfaaa3
这样做对不对