Data,Model and Decision智慧樹(shù)知到期末考試答案2024年

Data,ModelandDecision智慧樹(shù)知到期末考試答案2024年Data,ModelandDecisionTransportationproblemsalsobelongtonetworkflowproblemsparticularlyaboutallocation.（）

A:錯(cuò)誤B:正確答案:正確Theexpectedvalueandexpectedopportunitylosscriteriaresultinthesamedecision.（）

A:錯(cuò)誤B:正確答案:正確Theoptimalsolutionofintegerprogrammingistofindthecorrespondinglinearprogrammingoptimalsolutionandthenrounditup.()

A:錯(cuò)誤B:正確答案:錯(cuò)誤Bothbranch-and-cuttechniqueandbranch-and-boundtechniquearebasedonlinearprogrammingtosolveintegerprogramming.()

A:錯(cuò)誤B:正確答案:正確Theremustbeanoptimalsolutiontothetransportationproblem.(）

A:正確B:錯(cuò)誤答案:正確ThedecisionvariablevaluesinBinaryintegerprogrammingareeither0or1.()

A:錯(cuò)誤B:正確答案:正確Theminimalspanningtreeproblemistoconnectallnodesinanetworksothatthetotalbranchlengthsareminimized.()

A:錯(cuò)誤B:正確答案:正確AnyLPproblemhasitsuniquedualproblem.（）

A:正確B:錯(cuò)誤答案:正確Whereasabackwardpassthroughthenetworkismadetodeterminetheearliesttimes,thelatesttimesarecomputedusingaforwardpass.（）

A:錯(cuò)誤B:正確答案:錯(cuò)誤TheoptimalsolutionofLPproblemmustbeobtainedatthevertexoffeasibledomain.（）

A:正確B:錯(cuò)誤答案:錯(cuò)誤KruskalAlgorithmiscalledavoidcyclemethod,andit’sintuitiveinthesimplegraphtoget(n-1)piecesedgesinthegraphwithnnodes.(）

A:錯(cuò)誤B:正確答案:正確Aconditionalprobabilityistheprobabilitythataneventwilloccur,giventhatanothereventhasalreadyoccurred.()

A:正確B:錯(cuò)誤答案:正確Graphtheoryistostudytheobjectsandtheirrelationships,andit’sindependentofthegeometricshapeofthegraph.(）

A:正確B:錯(cuò)誤答案:正確Thetestnumbersthatareobtainedbytheclosedloopmethodarenotunique.(）

A:錯(cuò)B:對(duì)答案:錯(cuò)ThefollowingAOAnetworkiscorrect.()

A:錯(cuò)誤B:正確答案:正確HowmanydayscanactivityIbedelayed?()

A:15B:24C:29答案:29ThereisanEulercircuitintheconnectedgraphG,ifandonlyifthereis()inG.

A:morethantwooddverticesB:twooddverticesC:oneoddvertexD:nooddvertex答案:nooddvertexIntheLegoproductionproblem,theoptimalproductionplan(2tablesand2chairs)won’tchangeifthepriceoftablevarieswithintherangeof()andotherconditionsmaintainunchanged.

A:15~20B:＜15C:20~35D:＞35答案:15~20WhenthereisanupperlimitonresourceconstraintsinthenonstandardLP,thestandardformneedstoadd（）totheleftoftheinequalitiesinnonstandardLP.

A:SurplusvariablesB:ConstantsC:zeroD:Slackvariables`答案:Slackvariables`Theshadowpricesofsmallblocksandbigblocksare()and()respectively.

A:5;5B:5;6C:4;6D:4;5答案:5;5Thereisatransportationproblemthatincludes3supplyregionsand3demandregions,thenumberofbasicvariableintheinitialfeasibleschemeis().

A:5B:7C:6D:4答案:5TheconnecteddirectedgraphGisanEulergraphifandonlyiftheoutdegreeofeachvertex()theindegreeofeachvertex.

A:anyrelationshipB:＞C:＜D:=答案:=“Pleaseadda0-1variabletoexpresstherelationshipbetweenthesetwomutualexclusiveconstraints:x1≥0orx1≤-20（）。

A:x1≤-My,x1+20≤M(1-y),y=0or1,MisasufficientlylargepositivenumberB:-My≤x1,x1+20≤M(1-y),y=0or1,MisasufficientlylargepositivenumberC:My≤x1,x1+20≤M(1-y),y=0or1,MisasufficientlylargepositivenumberD:My≤x1,x1+20≥M(1-y),y=0or1,Misasufficientlylargepositivenumber答案:-My≤x1,x1+20≤M(1-y),y=0or1,MisasufficientlylargepositivenumberIftheprimalprobleminLPistofindthemaximum,allconstraintsare“≤”,andvariablesarenon-negative,thedualproblemistofindthe(),constraintsare(),andvariablesare().

A:maximum;≥;≤B:minimum;≤;≥C:minimum;≥;≥D:maximum;≥;≥答案:minimum;≥;≥What’sfeasibledomain?（）。

A:ThesetoffeasiblesolutionsB:TheregionincludingoptimalsolutionC:TheregionincludingfeasiblesolutionsD:Theregionincludingbasicsolutions答案:ThesetoffeasiblesolutionsWhat’sthenumberofcellsinthebasevariableforthiscase?()

A:7B:9C:8D:5答案:5Thelinearprogrammingmodeldoesn’tinclude().

A:StatevariablesB:ConstraintsC:DecisionvariablesD:Objectivefunction答案:StatevariablesIntheLegoproductionproblem,iftherearesomeextralargeandsmallblocksonthemarket,thepricesare$6and$4,respectively.Whichtypeofblockwouldyouliketopurchasetoproducemoreproducts?（）。

A:OnlysmallblockB:NeitherlargeorsmallblockC:OnlylargeblockD:Bothlargeandsmallblock答案:OnlysmallblockGiventheconditionalprobabilities,Bayesiananalysiscanrevise()by().

A:priorprobabilities;posteriorprobabilitiesB:posteriorprobabilities;priorprobabilities答案:priorprobabilities;posteriorprobabilitiesIntheprocessofmanagementscience,thestepof（）istodescribeafunctionalrelationshipthatincludesvariables,parameters,andequations.

A:modelB:dataC:conclusionD:decisions答案:modelWhenwesolveChinesepostmanproblem,therulesofadjustingtheedgesare().

A:TheadjustededgesofeachoddvertexareincreasedordecreasedinpairsB:AnytwooddverticesaredirectlyconnectedC:Foreachelementarycycleinthegraph,thesumofthelengthofrepeatededges≤halfofthecyclelengthD:Eachedgeisrepeatedatmostonce答案:Eachedgeisrepeatedatmostonce;Foreachelementarycycleinthegraph,thesumofthelengthofrepeatededges≤halfofthecyclelength;TheadjustededgesofeachoddvertexareincreasedordecreasedinpairsThecorrectstatementsaboutadvantagesofGanttchartare().

A:monitoringtheprogressofactivitiesB:avisualdisplayofaprojectscheduleC:determiningearliestcompletiontimeD:obviouslyknowinghowthedelayofoneactivityaffectsthestarttimeofanotheractivity答案:avisualdisplayofaprojectschedule;monitoringtheprogressofactivities;determiningearliestcompletiontimeThefollowingstatementsabouttheHungarianalgorithmforassignmentproblemarecorrect.().

A:Whenweperformatrialassignment,werepeatcrossingoutthoseextra0elementsuntilthenumberof0elementsselectedequaltotheorderofnewmatrixB:Whatweoughttodoiscoverall0elementswiththefeweststraightlinesC:ThefirststepofHungarianAlgorithmneedstoguaranteeatleastone0elementineachrowandcolumnD:Whenwemarktherowsandcolumnsduringcoveringall0elements,it’snotnecessarytomakethenumberoflinesmarkingunmarkedrowsandmarkedcolumnsequaltothenumberof0elementsselected.答案:ThefirststepofHungarianAlgorithmneedstoguaranteeatleastone0elementineachrowandcolumn;Whenweperformatrialassignment,werepeatcrossingoutthoseextra0elementsuntilthenumberof0elementsselectedequaltotheorderofnewmatrix;Whatweoughttodoiscoverall0elementswiththefeweststraightlinesIffeasibledomainforalinearprogrammingproblemhasnoboundaries,thentheproblemmay().

A:InfiniteoptimalsolutionsB:FiniteoptimalsolutionC:NoinfiniteoptimalsolutionD:Uniqueoptimalsolution答案:Noinfiniteoptimalsolution;Finiteoptimalsolution;Uniqueoptimalsolution;InfiniteoptimalsolutionsThesolutionmethodsofBIP(0-1integerprogramming)are().

A:GraphicalmethodB:EnumerationmethodC:ImplicitenumerationmethodD:Dualsimplexmethod答案:Implicitenumerationmethod;EnumerationmethodTheowneroftheColumbiaConstructionCompanymustdecidebetweenbuildingahousingdevelopment,constructingashoppingcenter,andleasingallthecompany'sequipmenttoanothercompany.Theprofitthatwillresultfromeachalternativewillbedeterminedbywhethermaterialcostsremainstableorincrease.Theprofitfromeachalternative,giventhetwopossibilitiesformaterialcosts,isshowninthefollowingpayofftable:

5、Undertheequallikelihoodcriterion,pleaseselectthebestdecision().

A:HousesB:shoppingcenterC:leasing答案:AI參考:正確答案是C：leasing。\n根據(jù)題干中的描述，ColumbiaConstructionCompany需要在建造住宅開(kāi)發(fā)項(xiàng)目、建設(shè)購(gòu)物中心和將公司所有設(shè)備租給另一家公司之間做出決策。每個(gè)選項(xiàng)的利潤(rùn)取決于材料成本是否穩(wěn)定或增加。根據(jù)給出的表格，按照可能性相等的標(biāo)準(zhǔn)，租賃設(shè)備的利潤(rùn)最高，因此最佳選擇是C選項(xiàng)。'Inabuscompany,thenumberofstaffs,includingdriversandconductors,requiredforabuslineduringeachtimeperiodisasfollowingtable.Letthestaffsbegintoworkatthebeginningofeachtimeperiodandworkcontinuouslyfor8hours.Howcanyouarrangethestaffingtomeettheworkneedswithaminimumnumberofstaffs?Thenumberofdecisionvariableis（）。

A:7B:5C:8D:6答案:AI參考:通過(guò)對(duì)題目中給出的信息進(jìn)行分析，可以得出以下結(jié)論：\n\n需要滿(mǎn)足工作需求的巴士線路員工人數(shù)隨時(shí)間的變化而變化，其中包含了司機(jī)和售票員。為了使員工人數(shù)最少，需要合理安排員工的工作時(shí)間。\n\n根據(jù)表格中的數(shù)據(jù)，我們可以列出以下決策變量：\n\n*司機(jī)：n1\n*售票員：n2\n\n根據(jù)題目中的條件，員工需要連續(xù)工作8小時(shí)，因此可以得出以下方程組：\n\nn1+n2=3\nn1+n2=4\nn1+n2=5\nn1+n2=6\nn1+n2=7\nn1+n2=8\nn1+n2=9\n\n通過(guò)觀察這些方程，我們可以發(fā)現(xiàn)方程組中包含了五個(gè)方程和七個(gè)未知數(shù)，因此選項(xiàng)B中的5個(gè)決策變量是不夠的。選項(xiàng)A中的7個(gè)決策變量是最小的滿(mǎn)足工作需求的數(shù)量。因此，正確答案是選項(xiàng)A：7。'AfarmerinIowaisconsideringeitherleasingsomeextralandorinvestinginsavingscertificatesatthelocalbank.Ifweatherconditionsaregoodnextyear,theextralandwillgivethefarmeranexcellentharvest.However,ifweatherconditionsarebad,thefarmerwilllosemoney.Thesavingscertificateswillresultinthesamereturn,regardlessoftheweatherconditions.Thereturnforeachinvestment,giveneachtypeofweathercondition,isshowninthefollowingpayofftable,

2、Undertheoptimistic/Maximaxcriterion,pleaseselectthebestdecision().

A:leaselandB:buysavingscertificate答案:AI參考:從給出的選項(xiàng)來(lái)看，Iowa的農(nóng)民正在考慮租賃一些額外的土地或在當(dāng)?shù)氐你y行投資儲(chǔ)蓄證書(shū)。如果明年的天氣條件良好，額外的土地將帶來(lái)豐收，但如果天氣條件不佳，農(nóng)民將面臨虧損。儲(chǔ)蓄證書(shū)的回報(bào)率與天氣條件無(wú)關(guān)，始終保持相同的回報(bào)。根據(jù)這個(gè)信息，我們可以通過(guò)樂(lè)觀/最大化標(biāo)準(zhǔn)來(lái)選擇最佳決策。對(duì)于樂(lè)觀/最大化標(biāo)準(zhǔn)，我們需要找到回報(bào)最高的選擇。從表格中可以看出，租賃土地的回報(bào)在所有天氣條件下都高于儲(chǔ)蓄證書(shū)，特別是在天氣良好的情況下，回報(bào)更是大幅增加。因此，根據(jù)樂(lè)觀/最大化標(biāo)準(zhǔn)，最佳決策是租賃土地。所以，正確答案是A：租賃土地。'TheAtlanticCoastConference(ACC)hasfourbasketballgamesonaparticularnight.Theconferenceofficew