Data,Model and Decision知到智慧樹期末考試答案題庫2024年秋華南理工大學

Data,ModelandDecision知到智慧樹期末考試答案題庫2024年秋華南理工大學WhenwesolveaLPmaximizationproblembybranch-and-bound,theobjectivefunctionvalueofanyfeasibleintegersolutionisthelowerboundofthisobjectivefunctionvalue.(）

A:對B:錯

答案:對Theoptimalsolutionofintegerprogrammingistofindthecorrespondinglinearprogrammingoptimalsolutionandthenrounditup.()

A:對B:錯

答案:錯Transportationproblemsalsobelongtonetworkflowproblemsparticularlyaboutallocation.（）

A:錯B:對

答案:對Theminimalspanningtreeproblemistoconnectallnodesinanetworksothatthetotalbranchlengthsareminimized.()

A:對B:錯

答案:對Graphtheoryistostudytheobjectsandtheirrelationships,andit’sindependentofthegeometricshapeofthegraph.(）

A:對B:錯

答案:對DijkstraAlgorithmcansolvetheshortestrouteproblemofdirectedgraphwithpositiveweightornegativeweight.()

A:對B:錯

答案:錯Aconditionalprobabilityistheprobabilitythataneventwilloccur,giventhatanothereventhasalreadyoccurred.()

A:錯B:對

答案:對Duringtheprocessofcalculatingthelowestcostschedule,theshortestdurationmayaffordahighertotalcostintheproject.()

A:錯B:對

答案:對Thetestnumbersthatareobtainedbytheclosedloopmethodarenotunique.(）

A:對B:錯

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

A:對B:錯

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

A:錯B:對

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

A:錯B:對

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

A:對B:錯

答案:對Iftheshadowpriceofacertainresourceisp,thenunderotherresourcesquantityunchanged,thiskindofresourceincreaseskunits,thevalueofobjectivefunctionmustincreasebypk.（）

A:對B:錯

答案:錯Theexpectedvalueandexpectedopportunitylosscriteriaresultinthesamedecision.（）

A:對B:錯

答案:對Whenwesolvetheproblemofmaximization,therelationshipbetweentheoptimalobjectivevalueofintegerprogrammingandthatofitscorrespondinglinearprogrammingis().

A:TheoptimalobjectivevalueofintegerprogrammingislessthanorequaltothatofLP

B:TheoptimalobjectivevalueofintegerprogrammingequalstothatofLP

C:Uncertainresults

D:TheoptimalobjectivevalueofintegerprogrammingisgreaterthanorequaltothatofLP

答案:TheoptimalobjectivevalueofintegerprogrammingislessthanorequaltothatofLPTheearlieststarttimeforanactivity,calledES,isdeterminedbythe()timethatallprecedingactivitieshavebeencompleted.

A:minimum

B:average

C:maximum

D:total

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

A:40B:50C:60D:70

答案:50Givingatransportationproblemwiththefollowingcosts,supply,anddemand,findtheoptimalsolutionminimumcost()

A:2475

B:2250

C:2515

D:2350

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

A:priorprobabilities;posteriorprobabilities

B:posteriorprobabilities;priorprobabilities

答案:priorprobabilities;posteriorprobabilitiesIntheLegoproductionproblem,theoptimalproductionplan(2tablesand2chairs)won’tchangeifthepriceoftablevarieswithintherangeof()andotherconditionsmaintainunchanged.

A:＞35

B:＜15

C:20~35

D:15~20

答案:15~20What’sthevalueofthefirstchoicethatthecompanydecidestoexploreitandsurelyfindtheoil?()

A:$600000

B:0

C:-$200000

D:$800000

答案:$600000Afterweshortenthedurationof1→3asthisnetworkshown,howdoestheindirectcostvary?()

A:increaseby33hundredyuan

B:decreaseby23hundredyuan

C:decreaseby100hundredyuan

D:decreaseby33hundredyuan

答案:decreaseby33hundredyuanWhat’sfeasiblesolution?（）。

A:Thesolutionsthatmeetallconstraints

B:Thenon-negativesolutionsthatmeetallconstraints

C:Thesolutionsthatmeetsomeconstraints

D:Thenon-negativesolutionsthatmeetsomeconstraints

答案:ThesolutionsthatmeetallconstraintsTheESsofnode6andnode7are()and()respectively.

A:23;25

B:23;10

C:23;23

答案:23;23Calculatingtestnumbersisto()unitfreightoftheodd-numberedcellandto()unitfreightoftheeven-numberedcellintheclosedloop.。

A:add;subtract

B:add;add

C:subtract;subtract

D:subtract;add

答案:add;subtractInthetransportationproblemwithsupplyvolumegreaterthansales,inordertoconstructthebalancedtransportationsheet,wemust（）。

A:setavirtualdestinationandavirtualorigin

B:setavirtualorigin

C:setavirtualdestination

D:notsetanyvirtualregions

答案:setavirtualdestinationTheprocessofDijkstraAlgorithmmainlyfocusesonlabelingnodeswithPandupdatingallnodes.Thefirststepalwaysstartswiththefirstnodev1,letP(v1)equal()andlabelremainingnodeswiththevalueof().

A:0;1

B:1;0

C:1;∞

D:0;∞

答案:0;∞Toapplytheconceptofexpectedvalueasadecision-makingcriterionwithcertaininformation,thedecisionmakershouldcomputeexpectedvalueby()eachdecisionoutcomeundereachstateofnature()theprobabilityofitsoccurrence.

A:adding;to

B:dividing;by

C:multiplying;by

D:subtracting;from

答案:multiplying;byTheowneroftheColumbiaConstructionCompanymustdecidebetweenbuildingahousingdevelopment,constructingashoppingcenter,andleasingallthecompany'sequipmenttoanothercompany.Theprofitthatwillresultfromeachalternativewillbedeterminedbywhethermaterialcostsremainstableorincrease.Theprofitfromeachalternative,giventhetwopossibilitiesformaterialcosts,isshowninthefollowingpayofftable:

5、Undertheequallikelihoodcriterion,pleaseselectthebestdecision().

A:HousesB:leasing

C:shoppingcenter

答案:shoppingcenterTheshadowpricesofsmallblocksandbigblocksare()and()respectively.

A:5;6

B:4;6

C:4;5

D:5;5

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

A:/

or

linearfunction

B:Both

and

nonlinearfunctions

C:Both

and

linearfunctions

D:/

or

nonlinearfunction

答案:Both

and

linearfunctionsIntheprogrammingmodelofstandardassignmentproblem(nassigneesandntasks),thenumberofdecisionvariablesis()

A:Noneofaboveiscorrect

B:n*n

C:n

D:2n

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

A:-My≤x1,x1+20≤M(1-y),y=0or1,Misasufficientlylargepositivenumber

B:My≤x1,x1+20≥M(1-y),y=0or1,Misasufficientlylargepositivenumber

C:My≤x1,x1+20≤M(1-y),y=0or1,Misasufficientlylargepositivenumber

D:x1≤-My,x1+20≤M(1-y),y=0or1,Misasufficientlylargepositivenumber

答案:-My≤x1,x1+20≤M(1-y),y=0or1,MisasufficientlylargepositivenumberThereisanEulercircuitintheconnectedgraphG,ifandonlyifthereis()inG.

A:twooddvertices

B:nooddvertex

C:oneoddvertex

D:morethantwooddvertices

答案:nooddvertexForwhatreasontheproductcrowdfundingprojectssettheminimumsalesrequirement?（）。

A:Manufacturingcoststructure

B:Economiesofscale

C:Operatingfactors

D:Marketingfactors

答案:Manufacturingcoststructure###Operatingfactors###EconomiesofscaleThefollowingstatementsabouttheHungarianalgorithmforassignmentproblemarecorrect.().

A:ThefirststepofHungarianAlgorithmneedstoguaranteeatleastone0elementineachrowandcolumn

B:Whenwemarktherowsandcolumnsduringcoveringall0elements,it’snotnecessarytomakethenumberoflinesmarkingunmarkedrowsandmarkedcolumnsequaltothenumberof0elementsselected.

C:Whenweperformatrialassignment,werepeatcrossingoutthoseextra0elementsuntilthenumberof0elementsselectedequaltotheorderofnewmatrix

D:Whatweoughttodoiscoverall0elementswiththefeweststraightlines

答案:ThefirststepofHungarianAlgorithmneedstoguaranteeatleastone0elementineachrowandcolumn###Whatweoughttodoiscoverall0elementswiththefeweststraightlines###Whenweperformatrialassignment,werepeatcrossingoutthoseextra0elementsuntilthenumberof0elementsselectedequaltotheorderofnewmatrixTheminimalspanningtree’slinearprogrammingmodelistominimizethesumofweightsforbranchesinthetree,andtheconstraintsutilizethe0-1modelandrequire().

A:Onlyoneed