Data,Model and Decision智慧樹知到期末考試答案章節(jié)答案2024年華南理工大學(xué)

Data,ModelandDecision智慧樹知到期末考試答案+章節(jié)答案2024年華南理工大學(xué)Theminimalspanningtree’slinearprogrammingmodelistominimizethesumofweightsforbranchesinthetree,andtheconstraintsutilizethe0-1modelandrequire().

答案:Onlyoneedgeenteringeachnodeexceptfortheroot;AtleastoneedgeconnectingtherootwithothernodesIffeasibledomainforalinearprogrammingproblemhasnoboundaries,thentheproblemmay().

答案:Noinfiniteoptimalsolution;Infiniteoptimalsolutions;Uniqueoptimalsolution;FiniteoptimalsolutionThefollowingstatementsabouttheHungarianalgorithmforassignmentproblemarecorrect.().

答案:ThefirststepofHungarianAlgorithmneedstoguaranteeatleastone0elementineachrowandcolumn;Whatweoughttodoiscoverall0elementswiththefeweststraightlines;Whenweperformatrialassignment,werepeatcrossingoutthoseextra0elementsuntilthenumberof0elementsselectedequaltotheorderofnewmatrixForwhatreasontheproductcrowdfundingprojectssettheminimumsalesrequirement?（）。

答案:Manufacturingcoststructure;Operatingfactors;EconomiesofscaleSomeofthefollowingstatementsareincorrect().

答案:Basicsolutionisasolutiongreaterthan0;TheoptimalsolutiontoLPisunique（）objectivefunction（）constraintsinthelinearprogrammingis/are（）ofvariables.

答案:Both

and

linearfunctionsThereisanEulercircuitintheconnectedgraphG,ifandonlyifthereis()inG.

答案:nooddvertex“Pleaseadda0-1variabletoexpresstherelationshipbetweenthesetwomutualexclusiveconstraints:x1≥0orx1≤-20（）。

答案:-My≤x1,x1+20≤M(1-y),y=0or1,MisasufficientlylargepositivenumberCalculatingtestnumbersisto()unitfreightoftheodd-numberedcellandto()unitfreightoftheeven-numberedcellintheclosedloop.。

答案:add;subtractToapplytheconceptofexpectedvalueasadecision-makingcriterionwithcertaininformation,thedecisionmakershouldcomputeexpectedvalueby()eachdecisionoutcomeundereachstateofnature()theprobabilityofitsoccurrence.

答案:multiplying;byTheprocessofDijkstraAlgorithmmainlyfocusesonlabelingnodeswithPandupdatingallnodes.Thefirststepalwaysstartswiththefirstnodev1,letP(v1)equal()andlabelremainingnodeswiththevalueof().

答案:0;∞Intheprogrammingmodelofstandardassignmentproblem(nassigneesandntasks),thenumberofdecisionvariablesis()

答案:n*nTheshadowpricesofsmallblocksandbigblocksare()and()respectively.

答案:5;5

答案:shoppingcenterInthetransportationproblemwithsupplyvolumegreaterthansales,inordertoconstructthebalancedtransportationsheet,wemust（）。

答案:setavirtualdestinationAfterweshortenthedurationof1→3asthisnetworkshown,howdoestheindirectcostvary?()

答案:decreaseby33hundredyuan

答案:2350Giventheconditionalprobabilities,Bayesiananalysiscanrevise()by().

答案:priorprobabilities;posteriorprobabilitiesTheHongmuFurnitureCompanyproducestables.Thefixedmonthlycostofproductionis$6000yuan,andthevariablecostpertableis$60yuan.Theretailpriceofatableis$180.Determinethemonthlybreak-evenvolumefortheHongmuFurnitureCompany.（）

答案:50TheESsofnode6andnode7are()and()respectively.

答案:23;23What’sfeasiblesolution?（）。

答案:ThesolutionsthatmeetallconstraintsWhenwesolvetheproblemofmaximization,therelationshipbetweentheoptimalobjectivevalueofintegerprogrammingandthatofitscorrespondinglinearprogrammingis().

答案:TheoptimalobjectivevalueofintegerprogrammingislessthanorequaltothatofLPWhat’sthevalueofthefirstchoicethatthecompanydecidestoexploreitandsurelyfindtheoil?()

答案:$600000IntheLegoproductionproblem,theoptimalproductionplan(2tablesand2chairs)won’tchangeifthepriceoftablevarieswithintherangeof()andotherconditionsmaintainunchanged.

答案:15~20Theearlieststarttimeforanactivity,calledES,isdeterminedbythe()timethatallprecedingactivitieshavebeencompleted.

答案:maximumTheexpectedvalueandexpectedopportunitylosscriteriaresultinthesamedecision.（）

答案:對(duì)Bothbranch-and-cuttechniqueandbranch-and-boundtechniquearebasedonlinearprogrammingtosolveintegerprogramming.()

答案:對(duì)Therearethreecommontechniquestosolveintegerprogramming,includingbranch-and-cut,branch-and-bound,andbionicalgorithm.（）

答案:對(duì)KruskalAlgorithmiscalledavoidcyclemethod,andit’sintuitiveinthesimplegraphtoget(n-1)piecesedgesinthegraphwithnnodes.(）

答案:對(duì)Iftheshadowpriceofacertainresourceisp,thenunderotherresourcesquantityunchanged,thiskindofresourceincreaseskunits,thevalueofobjectivefunctionmustincreasebypk.（）

答案:錯(cuò)Theoptimalsolutionofintegerprogrammingistofindthecorrespondinglinearprogrammingoptimalsolutionandthenrounditup.()

答案:錯(cuò)Duringtheprocessofcalculatingthelowestcostschedule,theshortestdurationmayaffordahighertotalcostintheproject.()

答案:對(duì)Transportationproblemsalsobelongtonetworkflowproblemsparticularlyaboutallocation.（）

答案:對(duì)WhenwesolveaLPmaximizationproblembybranch-and-bound,theobjectivefunctionvalueofanyfeasibleintegersolutionisthelowerboundofthisobjectivefunctionvalue.(）

答案:對(duì)Thetestnumbersthatareobtainedbytheclosedloopmethodarenotunique.(）

答案:錯(cuò)Graphtheoryistostudytheobjectsandtheirrelationships,andit’sindependentofthegeometricshapeofthegraph.(）

答案:對(duì)Aconditionalprobabilityistheprobabilitythataneventwilloccur,giventhatanothereventhasalreadyoccurred.()

答案:對(duì)DijkstraAlgorithmcansolvetheshortestrouteproblemofdirectedgraphwithpositiveweightornegativeweight.()

答案:錯(cuò)Undertheexpectedvaluecriterion,aslongasthedecisionmakerestimatestheprobabilityofoccurrenceofeachstateofnature,theexpectedvalueforeachdecisionalternativecanbecomputed.()

答案:對(duì)Theminimalspanningtreeproblemistoconnectallnodesinanetworksothatthetotalbranchlengthsareminimized.()

答案:對(duì)Decisiontreeconsistsof().

答案:decisionnode,statenode,andresultnodeIfthedecisionmakercangaintheprobabilityofeachstatebyinvestigation,decisionproblemunderuncertaintycanbetransformedtoriskydecisionproblem.(）

答案:對(duì)Thedecisioncriteria,whichincludeMaximax,Maximin,Minimaxregret,Hurwicz,andEquallikelihood,willresultinthesamedecision.()

答案:錯(cuò)Themethodofdecision-makingproblemincludes().

答案:Exceltool

答案:A→C→F→GIntheGanttcharts,thehorizontalaxisrepresentstimeandtheverticalaxisrepresentseachactivity.（）

答案:對(duì)Whenwecarryonthecalculationstepsforthelowestcostscheduleinnetworks,nomatterhowweshortenthedurationofactivities,thecriticalpathwon’tchange.(）

答案:錯(cuò)AvirtualactivityisusedinanAOAnetworktoshowanactualpassageoftime,notjusttheprecedencerelationship.(）

答案:錯(cuò)Thecriticalactivityincriticalpathis().

答案:thelongestdurationactivity

答案:2Intermsofgraphtheory,thefollowingstatementisincorrect().

答案:Nodesinatreemaynotbeconnectedtoeachother.TheBellmanalgorithmcanbeusedtofindouttheshortestroutefromv1toanyvertex,eventheweightbeingnegative.（）

答案:對(duì)Dijkstraalgorithmisonlyusedtocalculatetheshortestroutefromthefirstvertexv1toothervertices.(）

答案:錯(cuò)

答案:5;(v2,v3)Theincorrectstatementoftransportationprobleminthefollowingstatementsis().

答案:Thenumberofconstraintsequalsthenumberofbasevariables.

答案:-1Inthetransportationmodel,thenumberofdemandplacesandsupplyplacesisnandmrespectively.Thenumberofconstraintsis().

答案:m+nForthetransportationproblemofminimumvalue,theoptimaltransportationschemecanbegainedwhenthetestnumbersarelessthanorequaltozero.(）

答案:錯(cuò)Whenweadjustthetransportationschemebyclosed-loopmethod,theruleisthatthemaximumvalueoftransportationincreasinginthecellequalstheminimumvalueofthenumeralcelltobereduced,whichisto().

答案:makesurethatthetrafficvolumedoesnotappearnegative.Simplyroundingoffnon-integersimplexsolutionvaluesformodelsrequiringintegersolutionsisnotalwaysappropriate.Roundingcanoftenleadtosuboptimalresults.(）

答案:對(duì)Branch-and-cuttechniqueisonlysuitableforsolvingpureintegerprogrammingproblems.(）

答案:錯(cuò)

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

答案:x3+x5≤1,x4+x5≤1Assignmentproblemdoesn’tbelongto0-1integerprogrammingproblem.(）

答案:錯(cuò)Shadowpriceisactuallyamarginalprice.(）

答案:對(duì)Thefollowingstatementsof100%ruleofobjectivefunctioncoefficientiscorrect（）.

答案:Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreasedoesnotreach100%,theoptimalsolutionwon’tchange.Thedualityofadualproblemisnotnecessarilytheprimalproblem.(）

答案:錯(cuò)

答案:Y=(4/5,3/5,1,0)Iftheprimalproblemoflinearprogrammingaddsaconstraint,itisequivalenttoaddingavariabletothedualproblem.（）

答案:對(duì)ThefollowingfeaturesofstandardformofLinearprogrammingarecorrect（）.

答案:ThedecisionvariablesarenonnegativeTheoptimalsolutionofthelinearprogrammingproblemmustbethefeasiblesolution.（）

答案:對(duì)Iftheoptimalsolutionofthelinearprogrammingproblemisreachedattwoverticesoffeasibledomainatthesametime,thentheoptimalsolutionhas().

答案:Alinesegmentconnectingt