合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

        QBUS6820代做、Python編程語言代寫

        時(shí)間:2024-04-02  來源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯(cuò)



        QBUS6820: Prescriptive Analytics Assignment 1 Semester 1, 2024
        Instructions: Submit your answers in one pdf document with each question/part labelled clearly. You
        must also submit your code - the raw code (.ipynb file) and a html version of your Jupyter Notebook.
        Problem 1: Investing (6 marks)
        Suppose a friend of yours wants to invest $10,000 and has asked for your help. They’re thinking of
        investing in an index fund tied to the ASX200 and a tech stock fund, but they’re concerned about
        the volatility of tech stocks. They therefore want to take measures to manage their investment risk.
        They’ve decided that the amount invested in the tech fund cannot be higher than twice the amount
        invested in the index fund. The price per share of the index fund is $17, and the price per share of
        the tech fund is $20. Over the last 5 years, the average annual return for the index fund has been
        15%, and 25% for the tech fund. They expect the performance of the funds in the coming year to be
        identical to the recent past. Your friend wants to develop an investment strategy that will maximise
        their return for the coming year.
        (a) Formulate a linear programming model to help determine how much money they should invest
        in each fund.
        (b) Solve the model using Python.
        (c) If your friend can get $1 more to invest, how will that affect the solution? $2 more? $3 more?
        What can you say about the return on their investment strategy given these changes.
        Problem 2: Producing wine (7 marks)
        A winery produces and sells three types of wine across Australia — No.1, No.2, and No.3. A few
        months ago management discovered a large number of grapevines in the vineyard were infested with
        an insect pest that feeds on their roots and eventually kills them. They had no choice but to take
        out all the grapevines and replant their crop. It will take years for the new vines to mature and
        produce grapes so in the meantime they must purchase grape juice from other vineyards to make
        their wine.
        There are three vineyards that are willing to sell their grape juice to the company - A, B, and C.
        They are located in different and faraway parts of the country. As such, the company is looking
        at using more conveniently located winemaking and bottling facilities instead of its own. It has
        identified 4 facilities: W, X, Y, and Z.
        In a particular month vineyard A can supply 1,500 tons of grape juice, vineyard B 1,600 tons, and
        vineyard C 1,000 tons. The processing capacity per month at facility W is 1,300 tons, 1,000 tons at
        X, 1,300 tons at Y, and 1,500 tons at Z. The $ cost per ton of transporting juice from the vineyards
        to the facilities is as follows:
        W X Y Z
        A 850 720 910 750
        B 970 7** 1,050 880
        C **0 830 780 820
        The processing facilities have different equipment and have different wage rates. The cost of processing each type of wine at each plant ($/ton) therefore differs, and is as follows:
        W X Y Z
        No.1 2,100 2,350 2,200 1,**0
        No.2 4,100 4,300 3,950 3,**0
        No.3 2,600 2,300 2,500 2,800
        This month the company needs to process a total of 1,400 tons of No.1, 800 tons of No.2, and 600
        tons of No.3 at the four facilities combined. There are two complicating factors though. To produce
        1 ton of No.2 requires 2 tons of grape juice, and 1 ton of No.3 requires 1.5 tons of grape juice. 1 ton
        of No.1 requires 1 ton of juice.
        The company wants to know how many tons of grape juice to ship from each of the vineyards to each
        of the facilities, and the number of tons of each type of wine to produce at each facility to minimise
        total costs.
        Page 1 of 2
        QBUS6820: Prescriptive Analytics Assignment 1 Semester 1, 2024
        Problem 3: Assigning groups (7 marks)
        Assume you’re a course coordinator assigning 15 students to 5 teams for a project. You want the
        project teams to be relatively equal in terms of academic performance and to have a mix of different
        skills and domestic/international students. You’ve decided to use students’ grade point average
        (GPA) as a proxy for academic performance and to set a minimum average GPA of 2.75 for each
        team while also maximising the overall average GPA across teams. You’ve also decided to use
        students’ majors as a proxy for different skill sets, but you don’t want there to be more than two of
        the same major in any single team. You also want at least one international student on each team,
        but not more than two. The following table details the GPA, major, and internationality of each
        student in the cohort.
        Student GPA International Major
        1 3.10 Yes FIN
        2 2.30 No ACCT
        3 2.31 Yes BA
        4 2.10 Yes MKTG
        5 3.28 No BA
        6 3.** No FIN
        7 2.92 No FIN
        8 2.60 No FIN
        9 3.17 No FIN
        10 3.03 Yes MKTG
        11 3.40 Yes MKTG
        12 2.** No ACCT
        13 2.66 Yes MKTG
        14 2.86 No ACCT
        15 3.40 Yes BA
        Formulate and solve an integer linear programming model for this problem to determine project
        teams that align with your criteria. Do you think your model does a decent job of making sure the
        teams are diverse and academically equitable? If not, how might you change your model to achieve
        a better result?
        Page 2 of 2

        請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp









         

        掃一掃在手機(jī)打開當(dāng)前頁
      1. 上一篇:代寫CMSE11475、代做Java/Python編程
      2. 下一篇:菲律賓移民局辦理9g怎么操作 辦理9G工簽的材料
      3. 無相關(guān)信息
        合肥生活資訊

        合肥圖文信息
        挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
        挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
        戴納斯帝壁掛爐全國售后服務(wù)電話24小時(shí)官網(wǎng)400(全國服務(wù)熱線)
        戴納斯帝壁掛爐全國售后服務(wù)電話24小時(shí)官網(wǎng)
        菲斯曼壁掛爐全國統(tǒng)一400售后維修服務(wù)電話24小時(shí)服務(wù)熱線
        菲斯曼壁掛爐全國統(tǒng)一400售后維修服務(wù)電話2
        美的熱水器售后服務(wù)技術(shù)咨詢電話全國24小時(shí)客服熱線
        美的熱水器售后服務(wù)技術(shù)咨詢電話全國24小時(shí)
        海信羅馬假日洗衣機(jī)亮相AWE  復(fù)古美學(xué)與現(xiàn)代科技完美結(jié)合
        海信羅馬假日洗衣機(jī)亮相AWE 復(fù)古美學(xué)與現(xiàn)代
        合肥機(jī)場巴士4號(hào)線
        合肥機(jī)場巴士4號(hào)線
        合肥機(jī)場巴士3號(hào)線
        合肥機(jī)場巴士3號(hào)線
        合肥機(jī)場巴士2號(hào)線
        合肥機(jī)場巴士2號(hào)線
      4. 幣安app官網(wǎng)下載 短信驗(yàn)證碼 丁香花影院

        關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2024 hfw.cc Inc. All Rights Reserved. 合肥網(wǎng) 版權(quán)所有
        ICP備06013414號(hào)-3 公安備 42010502001045

        主站蜘蛛池模板: 中文字幕日韩一区| 无码人妻精品一区二区三区久久 | 综合久久久久久中文字幕亚洲国产国产综合一区首 | 日本免费一区二区三区四区五六区| 国模私拍福利一区二区| 一区二区三区免费电影| 亚洲a∨无码一区二区| 久久国产视频一区| 中文字幕一区二区视频| 精彩视频一区二区三区| 亚洲av日韩综合一区久热| 免费播放一区二区三区| 夜夜嗨AV一区二区三区| 精品一区二区三区高清免费观看| 欧洲精品码一区二区三区免费看 | 久久亚洲中文字幕精品一区四 | 无码人妻一区二区三区免费看 | 国产免费一区二区三区不卡| 国产成人一区二区三区精品久久 | 中文字幕人妻丝袜乱一区三区| 国产亚洲福利一区二区免费看| 亚洲欧美日韩一区二区三区在线| 亚洲一区在线免费观看| 精品无码AV一区二区三区不卡 | 一区二区三区无码高清| 精品无码人妻一区二区三区不卡 | 四虎精品亚洲一区二区三区| 中文字幕一区二区三| 日韩精品久久一区二区三区| 亚洲一区二区三区丝袜| 人妻互换精品一区二区| 色国产在线视频一区| 免费看无码自慰一区二区| 国产午夜一区二区在线观看| 美女免费视频一区二区三区| 国产精品视频一区二区三区不卡| 国产精品亚洲不卡一区二区三区 | 精品福利一区二区三| 日韩精品区一区二区三VR| 日本一区二区三区爆乳| 国产乱码精品一区二区三区 |