Data,Model and Decision知到章節(jié)答案智慧樹2023年華南理工大學(xué)_第1頁
Data,Model and Decision知到章節(jié)答案智慧樹2023年華南理工大學(xué)_第2頁
Data,Model and Decision知到章節(jié)答案智慧樹2023年華南理工大學(xué)_第3頁
Data,Model and Decision知到章節(jié)答案智慧樹2023年華南理工大學(xué)_第4頁
Data,Model and Decision知到章節(jié)答案智慧樹2023年華南理工大學(xué)_第5頁
免費(fèi)預(yù)覽已結(jié)束,剩余7頁可下載查看

下載本文檔

版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

Data,ModelandDecision知到章節(jié)測(cè)試答案智慧樹2023年最新華南理工大學(xué)第一章測(cè)試

Thepurposeofbreak-evenanalysisistodeterminethenumberofunitsofaproducttosellorproducethatwillequatetotalrevenuewithtotalcost.Atthebreak-evenpoint,theprofitis()zero.

參考答案:

equalto

Ingeneral,anincreaseinvariablecostswill()thebreak-evenpoint,allotherthingsheldconstant.

參考答案:

increase

It’simportanttomakefulluseoftechniquesinmanagementscienceprocess,whichtechniquesarecommonlyusedforthepurposeofdecision-making()?

參考答案:

Transportationandassignment

;Linearprogrammingmodels

;Projectmanagement(likeCPM/PERT)

;Decisionanalysis

Manufacturingcompaniesdeveloplinearprogrammingmodelstohelpdecidehowmanyunitsofdifferentproductstheyshouldproducetomaximizetheirprofit(orminimizetheircost),givenscarceresourcessuchascapital,labor,andfacilities.()

參考答案:

對(duì)

第二章測(cè)試

Ifthegraphicalmethodisusedtosolvethelinearprogrammingproblem,thenumberofdecisionvariablesshouldbe().

參考答案:

2

Inthelinearprogrammingmodel,()restrictthedecisionvariablestozeroorpositivevalues.

參考答案:

Nonnegativityconstraints

Iftheoptimalsolutionofthelinearprogrammingproblemisreachedattwoverticesoffeasibledomainatthesametime,thentheoptimalsolutionhas().

參考答案:

Alinesegmentconnectingtwovertices

ThefollowingfeaturesofstandardformofLinearprogrammingarecorrect().

參考答案:

Thedecisionvariablesarenonnegative

Theoptimalsolutionofthelinearprogrammingproblemmustbethefeasiblesolution.()

參考答案:

對(duì)

第三章測(cè)試

Giventhatalinearprogrammingproblemisasfollowing,theoptimalsolutionofdualproblemis().

參考答案:

Y=(4/5,3/5,1,0)

Thefollowingstatementsof100%ruleofobjectivefunctioncoefficientiscorrect().

參考答案:

Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreasedoesnotreach100%,theoptimalsolutionwon’tchange.

Thedualityofadualproblemisnotnecessarilytheprimalproblem.()

參考答案:

錯(cuò)

Shadowpriceisactuallyamarginalprice.()

參考答案:

對(duì)

Iftheprimalproblemoflinearprogrammingaddsaconstraint,itisequivalenttoaddingavariabletothedualproblem.()

參考答案:

對(duì)

第四章測(cè)試

PleasesolvethefollowingintegerproblemandgetthemaximumZ=().

參考答案:

Z=4

Adrillingteamneedstodetermine5explorationwellsfrom10alternativewellstominimizethetotaldrillingcost.If10wellsarerepresentedbys1,s2,…s10,thecostsbeingc1,c2,…c10,oneofconstraintsis:iftheplanchoosess3ors4,thens5cannotbeselectedandviceversa.Weseta0-1variable,xj(j=1,2,…10),thenthisconstraintcanbeexpressed()

參考答案:

x3+x5≤1,x4+x5≤1

Branch-and-cuttechniqueisonlysuitableforsolvingpureintegerprogrammingproblems.()

參考答案:

錯(cuò)

Simplyroundingoffnon-integersimplexsolutionvaluesformodelsrequiringintegersolutionsisnotalwaysappropriate.Roundingcanoftenleadtosuboptimalresults.()

參考答案:

對(duì)

Assignmentproblemdoesn’tbelongto0-1integerprogrammingproblem.()

參考答案:

錯(cuò)

第五章測(cè)試

Inthetransportationmodel,thenumberofdemandplacesandsupplyplacesisnandmrespectively.Thenumberofconstraintsis().

參考答案:

m+n

Theincorrectstatementoftransportationprobleminthefollowingstatementsis().

參考答案:

Thenumberofconstraintsequalsthenumberofbasevariables.

Whenweadjustthetransportationschemebyclosed-loopmethod,theruleisthatthemaximumvalueoftransportationincreasinginthecellequalstheminimumvalueofthenumeralcelltobereduced,whichisto().

參考答案:

makesurethatthetrafficvolumedoesnotappearnegative.

AcompanytransportsamaterialfromthreesupplyplacesA1,A2,andA3toB1,B2,andB3.Allinformationoftransportationvolumeislistedasthefollowingtable.Themiddlecellsarethepriceofunittransportationvolume.Fortheoptimalschemeofminimumcost,weutilizethetabularmethodforsolvingitandwecalculatethetestnumberofA2B3thatistheminimumpriceofunitvolumeinnon-basicvariables().

參考答案:

-1

Forthetransportationproblemofminimumvalue,theoptimaltransportationschemecanbegainedwhenthetestnumbersarelessthanorequaltozero.()

參考答案:

錯(cuò)

第六章測(cè)試

Intermsofgraphtheory,thefollowingstatementisincorrect().

參考答案:

Nodesinatreemaynotbeconnectedtoeachother.

Thereare()oddverticesinthegraph.

參考答案:

2

InordertogettheminimalspanningtreeofthisgraphbyKruskalAlgorithm,thenumberofremainingedgesis(D),andinascendingorderofweight,weshouldremaintheedge()withtheweightof5inordertoavoidcircle.

參考答案:

5;(v2,v3)

Dijkstraalgorithmisonlyusedtocalculatetheshortestroutefromthefirstvertexv1toothervertices.()

參考答案:

錯(cuò)

TheBellmanalgorithmcanbeusedtofindouttheshortestroutefromv1toanyvertex,eventheweightbeingnegative.()

參考答案:

對(duì)

第七章測(cè)試

IntheGanttcharts,thehorizontalaxisrepresentstimeandtheverticalaxisrepresentseachactivity.()

參考答案:

對(duì)

Thecriticalactivityincriticalpathis().

參考答案:

thelongestdurationactivity

Pleaseindicatethecriticalpathinthefollowingnetwork(everynumberbelowtheactivityrepresentsitsduration).()

參考答案:

A→C→F→G

AvirtualactivityisusedinanAOAnetworktoshowanactualpassageoftime,notjusttheprecedencerelationship.()

參考答案:

錯(cuò)

Whenwecarryonthecalculationstepsforthe

溫馨提示

  • 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

最新文檔

評(píng)論

0/150

提交評(píng)論