Data,Model and Decision智慧樹知到答案2024年華南理工大學(xué)

Data,ModelandDecision華南理工大學(xué)智慧樹知到答案2024年第一章測試

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

A:morethan

B:equalto

C:lessthan

答案:BIngeneral,anincreaseinvariablecostswill（）thebreak-evenpoint,allotherthingsheldconstant.

A:notchange

B:increase

C:decrease

答案:BIt’simportanttomakefulluseoftechniquesinmanagementscienceprocess,whichtechniquesarecommonlyusedforthepurposeofdecision-making（）?

A:Decisionanalysis

B:Transportationandassignment

C:Projectmanagement(likeCPM/PERT)

D:Linearprogrammingmodels

答案:ABCDManufacturingcompaniesdeveloplinearprogrammingmodelstohelpdecidehowmanyunitsofdifferentproductstheyshouldproducetomaximizetheirprofit(orminimizetheircost),givenscarceresourcessuchascapital,labor,andfacilities.(）

A:對B:錯(cuò)

答案:A

第二章測試

Ifthegraphicalmethodisusedtosolvethelinearprogrammingproblem,thenumberofdecisionvariablesshouldbe().

A:2

B:≥3

C:Nolimitation

D:≤5

答案:AInthelinearprogrammingmodel,()restrictthedecisionvariablestozeroorpositivevalues.

A:Thefeaturesofvariables

B:Nonnegativityconstraints

C:Resourcerequirements

D:Objectivefunction

答案:BIftheoptimalsolutionofthelinearprogrammingproblemisreachedattwoverticesoffeasibledomainatthesametime,thentheoptimalsolutionhas().

A:Astraightlineconnectingtwovertices

B:It’simpossible

C:Alinesegmentconnectingtwovertices

D:Twosolutions

答案:CThefollowingfeaturesofstandardformofLinearprogrammingarecorrect（）.

A:Noneofaboveistrue

B:Thedecisionvariablesarenotequaltozero

C:Thedecisionvariablesarenonnegative

D:Thereisnolimittothesymbolofdecisionvariables

答案:CTheoptimalsolutionofthelinearprogrammingproblemmustbethefeasiblesolution.（）

A:對B:錯(cuò)

答案:A

第三章測試

Giventhatalinearprogrammingproblemisasfollowing,theoptimalsolutionofdualproblemis().

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

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

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

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

答案:CThefollowingstatementsof100%ruleofobjectivefunctioncoefficientiscorrect（）.

A:Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreasedoesnotreach100%,theoptimalsolutionwon’tchange.

B:Onlycanincreasingcoefficientsfollowthis100%rule.

C:Noneofaboveiscorrect.

D:Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreaseequals100%,theoptimalsolutionwon’tchange.

答案:AThedualityofadualproblemisnotnecessarilytheprimalproblem.(）

A:錯(cuò)B:對

答案:AShadowpriceisactuallyamarginalprice.(）

A:錯(cuò)B:對

答案:BIftheprimalproblemoflinearprogrammingaddsaconstraint,itisequivalenttoaddingavariabletothedualproblem.（）

A:對B:錯(cuò)

答案:A

第四章測試

PleasesolvethefollowingintegerproblemandgetthemaximumZ=().

A:Z=5

B:Z=4

C:Z=3

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

A:x3+x5=1,x4+x5=1

B:x3+x4+x5≤1

C:x3+x5≤1,x4+x5≤1

D:x3+x5≥1,x4+x5≥1

答案:CBranch-and-cuttechniqueisonlysuitableforsolvingpureintegerprogrammingproblems.(）

A:錯(cuò)B:對

答案:ASimplyroundingoffnon-integersimplexsolutionvaluesformodelsrequiringintegersolutionsisnotalwaysappropriate.Roundingcanoftenleadtosuboptimalresults.(）

A:對B:錯(cuò)

答案:AAssignmentproblemdoesn’tbelongto0-1integerprogrammingproblem.(）

A:錯(cuò)B:對

答案:A

第五章測試

Inthetransportationmodel,thenumberofdemandplacesandsupplyplacesisnandmrespectively.Thenumberofconstraintsis().

A:m*n

B:m+n-1

C:m+n

D:m*n-1

答案:CTheincorrectstatementoftransportationprobleminthefollowingstatementsis().

A:Itmusthavetheoptimalsolution.

B:Itcanutilizethesimplexalgorithmoflinearprogrammingtosolve.

C:Itcanutilizethetabularmethodtosolve.

D:Thenumberofconstraintsequalsthenumberofbasevariables.

答案:DWhenweadjustthetransportationschemebyclosed-loopmethod,theruleisthatthemaximumvalueoftransportationincreasinginthecellequalstheminimumvalueofthenumeralcelltobereduced,whichisto().

A:makesurethatthebalanceofproductionandsellingcanberealized.

B:makesurethatthetrafficvolumedoesnotappearnegative.

C:makesurethattheoptimalschemecanberealized.

D:makesurethatthefreightcostcanbereducedtoacertainextent.

答案:BAcompanytransportsamaterialfromthreesupplyplacesA1,A2,andA3toB1,B2,andB3.Allinformationoftransportationvolumeislistedasthefollowingtable.Themiddlecellsarethepriceofunittransportationvolume.Fortheoptimalschemeofminimumcost,weutilizethetabularmethodforsolvingitandwecalculatethetestnumberofA2B3thatistheminimumpriceofunitvolumeinnon-basicvariables().

A:-1

B:7

C:2

D:1

答案:AForthetransportationproblemofminimumvalue,theoptimaltransportationschemecanbegainedwhenthetestnumbersarelessthanorequaltozero.(）

A:錯(cuò)B:對

答案:A

第六章測試

Intermsofgraphtheory,thefollowingstatementisincorrect().

A:Ifanedgeisremovedfromatree,thetreewon’tbeconnected.

B:Nodesinatreemaynotbeconnectedtoeachother.

C:Ifatreehasnnodes,thenumberofitsedgesisn-1.

D:Ifthereisonemoreedgeinthetree,theremustbeacircle.

答案:BThereare()oddverticesinthegraph.

A:1B:3C:2D:4

答案:CInordertogettheminimalspanningtreeofthisgraphbyKruskalAlgorithm,thenumberofremainingedgesis(D),andinascendingorderofweight,weshouldremaintheedge()withtheweightof5inordertoavoidcircle.

A:5;(v2,v3)

B:6;(v2,v3)

C:5;(v3,v4)

D:6;(v1,v4)

答案:ADijkstraalgorithmisonlyusedtocalculatetheshortestroutefromthefirstvertexv1toothervertices.(）

A:對B:錯(cuò)

答案:BTheBellmanalgorithmcanbeusedtofindouttheshortestroutefromv1toanyvertex,eventheweightbeingnegative.（）

A:錯(cuò)B:對

答案:B

第七章測試

IntheGanttcharts,thehorizontalaxisrepresentstimeandtheverticalaxisrepresentseachactivity.（）

A:對B:錯(cuò)

答案:AThecriticalactivityincriticalpathis().

A:theearliestbeginningactivity

B:themostimportantactivity

C:thelongestdurationactivity

D:theendactivity

答案:CPleaseindicatethecriticalpathinthefollowingnetwork(everynumberbelowtheactivityrepresentsitsduration).()

A:A→C→F→G

B:A→B→D→F→G

C:A→B→E→G

答案:AAvirtualactivityisusedinanAOAnetworktoshowanactualpassageoftime,notjusttheprecedencerelationship.(）

A:錯(cuò)B:對

答案:AWhenwecarryonthecalculationstepsforthelowestcostscheduleinnetworks,nomatterhowweshortenthedu